International Journal of Computer Applications |
Foundation of Computer Science (FCS), NY, USA |
Volume 57 - Number 18 |
Year of Publication: 2012 |
Authors: Prateek Agrawal, Harjeet Kaur, Gurpreet Singh |
10.5120/9215-3764 |
Prateek Agrawal, Harjeet Kaur, Gurpreet Singh . Indexed Tree Sort: An Approach to Sort Huge Data with Improved Time Complexity. International Journal of Computer Applications. 57, 18 ( November 2012), 26-32. DOI=10.5120/9215-3764
Sorting has been found to be an integral part in many computer based systems and applications. Efficiency of sorting algorithms is a big issue to be considered. This paper presents the efficient use of Indexing with Binary Search Trees (BST) to model a new improved sorting technique, Indexed Tree (IT)-Sort, capable of working with huge data. Along with design and implementation details, major emphasis has been placed on complexity, to prove the effectiveness of new algorithm. Complexity comparison of IT-Sort with other available sorting algorithm has also been carried out to ascertain its competence in worst case also. In this paper, we describe the formatting guidelines for IJCA Journal Submission.