Call for Paper - March 2023 Edition
IJCA solicits original research papers for the March 2023 Edition. Last date of manuscript submission is February 20, 2023. Read More

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

Print
PDF
International Journal of Computer Applications
© 2012 by IJCA Journal
Volume 57 - Number 18
Year of Publication: 2012
Authors:
Prateek Agrawal
Harjeet Kaur
Gurpreet Singh
10.5120/9215-3764

Prateek Agrawal, Harjeet Kaur and Gurpreet Singh. Article: Indexed Tree Sort: An Approach to Sort Huge Data with Improved Time Complexity. International Journal of Computer Applications 57(18):26-32, November 2012. Full text available. BibTeX

@article{key:article,
	author = {Prateek Agrawal and Harjeet Kaur and Gurpreet Singh},
	title = {Article: Indexed Tree Sort: An Approach to Sort Huge Data with Improved Time Complexity},
	journal = {International Journal of Computer Applications},
	year = {2012},
	volume = {57},
	number = {18},
	pages = {26-32},
	month = {November},
	note = {Full text available}
}

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

  • Alfred V. Aho, John E. Hopcroft, and Jeffrey D. Ullman. The Design and Analysis of Computer Algorithms. Addison Wesley, 1974.
  • Cormen T. , Leiserson C. , Rivest R. and Stein C. , Introduction to Algorithms, McGraw Hill, 2001.
  • Liu C. L. , Analysis of sorting algorithms, Proceedings of Switching and Automata Theory, 12th Annual Symposium, 1971, East Lansing, MI, USA, pp 207-215
  • Zulkarnain Md. Ali, Reduce Computation Steps Can Increase the Efficiency of Computation Algorithm, Journal of Computer Science 6, 1203-1207, 2010
  • Brian W. Kernighan, Dennis M. Ritchie, The C Programming Language
  • Box R. and Lacey S. , A Fast Easy Sort, Computer Journal of Byte Magazine, vol. 16,no. 4, pp. 315-315, 1991.
  • 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.
  • Hari Krishna Gurram & Gera Jaideep, Index Sort, International Journal of Experimental Algorithms (IJEA), Volume 2: Issue (2) : pp:55-62, 2011