Notice:

• the right side of the screen is in sorted order
• the next element swaps to the right until it is also in sorted order
• this inner loop can terminate early
• best case complexity is thus O(n)