Title :
Bidirectional Expansion - Insertion Algorithm for Sorting
Author :
Srivastava, Rupesh ; Tiwari, Tarun ; Singh, Sweetesh
Author_Institution :
Dept. of Comput. Sci. & Eng., Motilal Nehru Nat. Inst. of Technol., Allahabad, India
Abstract :
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.
Keywords :
computational complexity; sorting; bidirectional expansion; insertion sort methodology; sorting algorithm; time complexity analysis; Algorithm design and analysis; Computer science; Sorting;
Conference_Titel :
Emerging Trends in Engineering and Technology (ICETET), 2009 2nd International Conference on
Conference_Location :
Nagpur
Print_ISBN :
978-1-4244-5250-7
Electronic_ISBN :
978-0-7695-3884-6
DOI :
10.1109/ICETET.2009.48
