# Unusual Sorting Technique? Is It Effective?

$A = [9, 12, 1, 20, 17, 4, 10, 7, 15, 8, 13, 14]$

Given the above list, we would like to sort it in increasing order. To accomplish this, we will perform the following operation repeatedly:

Remove an element, then insert it at any position that you choose in the list, shifting elements if necessary.

What is the minimum number of applications of this operation necessary to sort $$A$$?

×