TY  - JOUR
TI  - Look Back Sort : A Backward Comparison Algorithm for Internal Sorting
AU  - Jyoti Lakhani
AU  -  Kirti Shrimali
AU  -  Dharmesh Harwani
JO  - International Journal of Scientific Research in Computer Science, Engineering and Information Technology
PB  - Technoscience Academy
DA  - 2017/12/31
PY  - 2017
DO  - https://doi.org/10.32628/IJSRCSEIT
UR  - https://ijsrcseit.com/CSEIT11726311
VL  - 2
IS  - 6
SP  - 1239	
EP  - 1243
AB  - 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<<n where n is denoting the current index. The correlation and covariance analyses also revealed that the proposed algorithm improves the performance of sorting process in the worst case highly significantly without compromising its simplest execution. Moreover, the completion of the sorting process in a single run is its additional advantage.