Enhanced Insertion Sort Algorithm

Sorting is integral part of many computer based systems and applications, as it involves rearranging information into either ascending or descending order. There are many sorting algorithms like Quick sort, Heap sort, Merge sort, Insertion sort, Selection sort, Bubble sort and Freezing sort. However, efforts have been made to improve the performance of the algorithm in terms of efficiency, indeed a big issue to be considered. Major Emphasis has been placed on complexity by reducing the Number of comparisons, hence reducing complexity. This paper presents new sorting algorithm EIS, "ENHANCED INSERTION SORT". It is basically an enhancement toINSERTION SORT (a kind of Hybrid sorting technique) by making it impressively faster algorithm with O(n)complexity as compared to O(n2) of insertion sort in worst case and less than O(n1. 585) in average case which is much better than insertion sort O(n2). It works flawlessly with huge lists of elements. To prove the effectiveness of the algorithm, the new algorithm is analyzed, implemented, tested and results has been carried out and compared with other major sorting algorithms and the results were promising.