Figure 4 illustrates the comparison of performance of the enhanced and classical version along with the cocktail sort or shaker sort or the so-called dual selection sort in terms of the time required to sort a list with random data, which represents the average case. The comparison with the insertion sort shows the degree of improvement by the enhancement of the selection sort. The bingo sort and exact sort are avoided in this discussion as they are limited to some special situations and may perform worse than the classical selection sort in other contexts. The measurements are taken on a 2.4 GHz Intel Core 2 Duo processor with 2 GB 1067 MHz DDR3 memory machine with OS X version 10.6.8 platform. It depicts the improved performance in terms of execution time. It shows a performance improvement of around 220-230%for random or reversely sorted list of any size to be sorted.