## QuickSort wins MergeSort at sorting Array

- QS is an in place sort [means swap elements within 1 array only]
- MS requires O(N) extra storage [need to assign new arrays to store value]
- Tail recursive, tail call optimizations [NO IDEA WHAT IT MEANS]
- Everyone is saying QS is practical

## MergSort wins QuickSort at sorting Linked List

reference: http://www.geeksforgeeks.org/quick-sort/