Quick Sort and Merge Sort

Question

Can anyone tell me in simple language why quick sort is preferred for array and merge sort for linked list??

Answer 1

Quick sort is divide and conquer algorithm so it is recursive so there it is very efficient for arrays bcz it's execution is slow and won't matter as the size of array will be short and merge sort is combination of both recursive and non recursive so it's efficient for linked list as it gives faster result hope it clears your doubt

Answer 2

I also have same question... But Aysha[left] , both are not devide and conquer algo ? Also both are recursive and has complexity as n log n. Also size of array is not necessarily be small only ...
What I feel is that array is contiguous and hence any random access is faster... For quick sort , we need to access randomly for pivot element. Hence , quick sort is best on array compared to link list. Merge sort does not ask for random access of data.
I am stil not sure. Is my understanding correct ?

Answer 3

Also below article of SL talks about why to choose merge sort for linked list
https://www.sololearn.com/learn/660/?ref=app