There's this and there's binary insertion sort. The two are pretty similar. They're both quadratic (O(n^2)) time algorithms.
Both algorithms do O(n log n) number of comparisons, but in practice you would also have to move elements around, which would make the entire algorithm quadratic.