KENDRIYA VIDYALAYA

So for n=7 only 6 (i.e. n-1) iterations are required and in each iteration only one comparison is required i.e. total number of comparisons required= (n-1)=6 which is better than the selection sort (for sorted array selection sort required n(n-1)/2 comparisons). ................
................