Merge sort and selection difference. Explain merge sort working. Time complexities of some famous sorting algorithms.

Question

Accepted Answer

Merge sort and selection sort are both sorting algorithms, but they differ in their approach and efficiency. Merge sort is a divide-and-conquer algorithm with a time complexity of O(n log n).

Merge sort divides the array into two halves, sorts each half recursively, and then merges the sorted halves back together.
Selection sort selects the smallest element from the unsorted portion of the array and swaps it with the first unsorted element.
Merge sort has a time complexity of O(n log n), while selection sort has a time complexity of O(n^2).
Examples of famous sorting algorithms and their time complexities: Bubble sort (O(n^2)), Quick sort (O(n log n)), Heap sort (O(n log n)).

Merge sort and selection difference. Explain merge sort working. Time complexities of some famous sorting algorithms.

Top Fendahl Technology Graduate Trainee interview questions & answers

Popular interview questions of Graduate Trainee