Binary insertion sort. Since insertion sort inserts the next unsorted element into the sorted subarray, use binary search to determine where the element belongs. Does this work? What is the asymptotic?