Comparing Sorts
Both Selection and Insertion Sorts are similar in efficiency
The both have outer loops that scan all elements, and inner loops that compare the value of the outer loop with almost all values in the list
That is approximately n2 number of comparisons for a list of size n
We therefore say that these sorts are of order n2
Other sorts are more efficient: order n log2 n