title: Insertion Sort of O(n^2) complexity and using Binary Search on previous values to improve complexity
body: <p>How would the algorithm's (of Insertion Sort of <code>O(n^2)</code>) complexity change if you changed the algorithm to use a binary search instead of searching previous values until you found where to insert your current value. Also, When would this be useful?</p>