Bidirectional Expansion - Insertion Algorithm for Sorting
Rupesh Srivastava, Tarun Tiwari, Sweetesh Singh · 2009
In this paper we present a sorting algorithm, which uses the methodology of insertion sort efficiently to give a much better performance than the existing sorting algorithms of the O(n2) class. We prove the correctness of the algorithm and give a detailed time complexity analysis of the algorithm. We also describe various applications of the algorithms.