Moving element once instead of swapping multiple times for insertion sort

Question

I was trying to write the code for insertion sort and realized that instead of swapping an element with its previous element if it is smaller, why not just find the position of