Smart data structures and
dumb code works a lot better than the other way around

Sorting Technique

After completion of every pass largest number occupy its position

After completion of every pass smallest number occupy its position

In selection sort, find the smallest number from list and swipe it with lower bound.

In insertion sort the sorting will always start one index ahead from the lower bound