Question

Out of Quick Sort and Merge Sort, which algorithm is preferred to sort an array and a Linked List and why?

Answer 1

Quick Sort in its general form is an in-place sort (i.e. it doesn't require any extra storage) whereas merge sort requires O(N) extra storage, N denoting the array size which may be quite expensive. Allocating and de-allocating the extra space used for merge sort increases the running time of the algorithm