2) Explain Merge Sort and Quick Sort

Question

Accepted Answer

Merge Sort and Quick Sort are two popular sorting algorithms used to sort arrays.

Merge Sort divides the array into two halves, sorts them recursively, and then merges them back together.
Quick Sort selects a pivot element, partitions the array around the pivot, and then recursively sorts the two resulting sub-arrays.
Merge Sort has a worst-case time complexity of O(nlogn), while Quick Sort has a worst-case time complexity of O(n^2).
Merge Sort is stable, meaning that it preserves the relative order of equal elements, while Quick Sort is not necessarily stable.
Merge Sort requires additional memory to store the two sub-arrays during the merge step, while Quick Sort sorts the array in place.

Top Target interview questions & answers