Interview Question for Senior Software Engineer at LinkedIn:

- You can use both Merge Sort and Quick sort to sort arrays, because array allows random access (O(1)) of elements in array by index. You need to be able to access by index for both Merge and quick sorts
- However
Time complexity: Merge sort :O( n logn)
                            QuickSort = O(n logn) (average)
Space complexity: Merge sort :O( n logn)
                                 QuickSort : O(n)