title: SORTING ALGORITHM QUICK SORT vs INSERTION SORT
body: <p>Quicksort is an O(nlog(n)) sorting algorithm. Does this mean it will always be faster than an insertion sort which is an O(n2) algorithm? Why/Why not?</p>