ABSTRACT – Optimized Selection Sort Algorithm is a new
sorting algorithm that has been developed to address the
shortcomings of the current popular sorting algorithms. The
goal of this research is to perform an extensive empirical
analysis of Optimized Selection Sort against Selection Sort
and Insertion Sort Algorithms. The results proved that
Optimized Selection Sort is much more efficient than
Selection Sort Algorithm; Furthermore analysis supports the
fact that Optimized Selection Sort is better than Insertion Sort
in worst case scenario.
Key Words: Optimized Selection Sort, Worst Case,
Efficiency, Sorting Algorithm