Please correct if any of the point is wrong :
Quicksort:
1.Need more random accesses
2 Used when Random access is fast (hence preferred on array and not on Linked List)
2 No extra space needed ==> Inplace
4 Not a stable sorting algorithm
5 even in worst case using randomized quick sort (O(n^2)
MergeSort:
1 Need Less random accesses than quicksort
2 Preferred When random access is very slow(On linked list)
3 why Not preferred for array over quicksort ?? ==> Extra space needed auxillary array O(N)
4 Extra space needed when applied on Array | No extra space needed when applied on Linked List
4 Stable sorting algo
Somone please explain this point its from geeksforgeeks:
Quicksort in particular exhibits good cache locality and this makes it faster than merge sort in many cases like in virtual memory environment.