Blue Dart Express SDE Interview Questions and Answers

Merge sort is a divide and conquer algorithm that recursively splits an array into halves, sorts them, and then merges them back together.

• Merge sort is efficient for sorting large arrays.

• It has a time complexity of O(n log n).

• It is a stable sorting algorithm.

• Example: ['apple', 'banana', 'orange', 'grape', 'kiwi']