Consider the following algorithm: The given items are inserted one by one into a list by performing comparisons like a binary search for the right position.
Example: Imagine six elements are already sorted in descending order. We now compare the next element to one of the middle elements. Assume it's smaller than #3 (on the left) so we compare it to the middle one of the remaining elements. Assume it's bigger than #5 so we make one last comparison and find it is smaller than #4 so we insert it as the new #5. On the right is another example.
I couldn't find any resources on this, under what name is it known? Thanks in advance.