What is merge sort and Quick sort. Adv and Disadv of each and which one would u use to sort huge list and Y

Question

Accepted Answer

Merge sort and Quick sort are sorting algorithms used to sort arrays of data.

Merge sort is a divide and conquer algorithm that divides the input array into two halves, sorts each half recursively, and then merges the sorted halves.
Quick sort is also a divide and conquer algorithm that selects a pivot element and partitions the array around the pivot, sorting the two resulting sub-arrays recursively.
Merge sort has a time complexity of O(n log n) and is stable, but requires additional memory for the merging process.
Quick sort has an average time complexity of O(n log n), but can degrade to O(n^2) in worst-case scenarios. It is not stable, but requires less additional memory than merge sort.
For sorting a huge list, merge sort would be a better choice due to its stable time complexity and ability to handle large amounts of data.
Example: Sorting a list of 1 million integers using merge sort would take approximately 20 milliseconds on a modern computer.
Example: Sorting a list of 1 million integers using quick sort could take up to several seconds in worst-case scenarios.

Top Adobe Member Technical Staff interview questions & answers