CFP last date
20 December 2024
Call for Paper
January Edition
IJCA solicits high quality original research papers for the upcoming January edition of the journal. The last date of research paper submission is 20 December 2024

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

Indexed Tree Sort: An Approach to Sort Huge Data with Improved Time Complexity

by Prateek Agrawal, Harjeet Kaur, Gurpreet Singh
journal cover thumbnail

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

@article{ 10.5120/9215-3764,
author = { Prateek Agrawal, Harjeet Kaur, Gurpreet Singh },
title = { Indexed Tree Sort: An Approach to Sort Huge Data with Improved Time Complexity },
journal = { International Journal of Computer Applications },
issue_date = { November 2012 },
volume = { 57 },
number = { 18 },
month = { November },
year = { 2012 },
issn = { 0975-8887 },
pages = { 26-32 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume57/number18/9215-3764/ },
doi = { 10.5120/9215-3764 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:00:49.290586+05:30
%A Prateek Agrawal
%A Harjeet Kaur
%A Gurpreet Singh
%T Indexed Tree Sort: An Approach to Sort Huge Data with Improved Time Complexity
%J International Journal of Computer Applications
%@ 0975-8887
%V 57
%N 18
%P 26-32
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

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.

References
  1. Alfred V. Aho, John E. Hopcroft, and Jeffrey D. Ullman. The Design and Analysis of Computer Algorithms. Addison Wesley, 1974.
  2. Cormen T. , Leiserson C. , Rivest R. and Stein C. , Introduction to Algorithms, McGraw Hill, 2001.
  3. Liu C. L. , Analysis of sorting algorithms, Proceedings of Switching and Automata Theory, 12th Annual Symposium, 1971, East Lansing, MI, USA, pp 207-215
  4. Zulkarnain Md. Ali, Reduce Computation Steps Can Increase the Efficiency of Computation Algorithm, Journal of Computer Science 6, 1203-1207, 2010
  5. Brian W. Kernighan, Dennis M. Ritchie, The C Programming Language
  6. Box R. and Lacey S. , A Fast Easy Sort, Computer Journal of Byte Magazine, vol. 16,no. 4, pp. 315-315, 1991.
  7. G. Franceschini and V. Geffert, An In-place Sorting with O (n logn) comparisons and O(n) moves, In Proc. 44th Annual IEEE Symposium on Foundations of Computer Science, pages 242-250, 2003.
  8. Hari Krishna Gurram & Gera Jaideep, Index Sort, International Journal of Experimental Algorithms (IJEA), Volume 2: Issue (2) : pp:55-62, 2011
Index Terms

Computer Science
Information Sciences

Keywords

Computing Sorting Algorithm Complexity Huge Data Set Binary Search Tree (BST) Indexing

Powered by PhDFocusTM