Benjamin Landers

In your [visualizing sorting algorithm post](https://github.com/thesephist/dotink/blob/8453007d6a760290a4255f77f3b2642c7d1f2793/content/posts/visualizing-sorting-algorithms.md) you describe both insertion and selection sorts as O(n). Generally these are both considered to take O(n^2) time in the worst case. Selection sort...