Manuscript Number : CSEIT11726311
Look Back Sort : A Backward Comparison Algorithm for Internal Sorting
Authors(3) :-Jyoti Lakhani, Kirti Shrimali, Dharmesh Harwani Present communication is an attempt to develop a novel algorithm "Look-Back Sort" (LB Sort) for internal sorting. The objective of the present research work was to reduce the space and time complexities of the sorting process in the worst cases. The performance of all internal sorting algorithms in worst cases are bound to O(n log n). To address the issue, the proposed algorithm is implemented first followed by its benchmarking with some other internal sorting algorithms. The empirical analysis of algorithms using C++ function is performed on the numeric samples vary in size. It was observed that the runtime of the LB-sort algorithm is highly comparable with the Quick sort algorithm in the worst case analysis. The overall time complexity of the proposed algorithm is observed to be O(n log k) when k<
Jyoti Lakhani internal sorting, backward comparison, benchmarking, empirical study, space complexity, time complexity Publication Details Published in : Volume 2 | Issue 6 | November-December 2017 Article Preview
Department of Computer Science, Maharaja Ganga Singh University, Bikaner, Rajasthan, India
Kirti Shrimali
Department of Computer Science, Maharaja Ganga Singh University, Bikaner, Rajasthan, India
Dharmesh Harwani
Department of Microbiology, Maharaja Ganga Singh University, Bikaner, Rajasthan, India
Date of Publication : 2017-12-31
License: This work is licensed under a Creative Commons Attribution 4.0 International License.
Page(s) : 1239-1243
Manuscript Number : CSEIT11726311
Publisher : Technoscience Academy