Home   >   CSC-OpenAccess Library   >    Manuscript Information
Full Text Available

This is an Open Access publication published under CSC-OpenAccess Policy.
Publications from CSC-OpenAccess Library are being accessed from over 74 countries worldwide.
Hari Krishna Gurram, Jaideep Gera
Pages - 55 - 61     |    Revised - 01-09-2011     |    Published - 05-10-2011
Volume - 2   Issue - 2    |    Publication Date - September / October 2011  Table of Contents
Index Sort, Binary Search, Position
One of the fundamental issues in computer science is ordering a list of items. Although there is a number of sorting algorithms, sorting problem has attracted a great deal of research, because efficient sorting is important to optimize the use of other algorithms. This paper presents a new sorting algorithm (Index Sort) which runs based on the previously sorted elements.. This algorithm was analyzed, implemented and tested and the results are promising for a random data.
CITED BY (1)  
1 Agrawal, P., Kaur, H., & Singh, G. (2012). Indexed Tree Sort: An Approach to Sort Huge Data with Improved Time Complexity. International Journal of Computer Applications, 57(18).
1 CiteSeerX 
2 Scribd 
3 SlideShare 
4 PdfSR 
1 Kruse R., and Ryba A., Data Structures and Program Design in C++, Prentice Hall, 1999.
2 Shahzad B. and Afzal M., “Enhanced ShellSorting Algorithm,” Computer Journal of Enformatika, vol. 21, no. 6, pp. 66-70, 2007.
3 Cormen T., Leiserson C., Rivest R., and Stein C., Introduction to Algorithms, McGraw Hill, 2001.
4 Aho A., Hopcroft J., and Ullman J., The Design and Analysis of Computer Algorithms, Addison Wesley, 1974.
5 Astrachanm O., Bubble Sort: An Archaeological Algorithmic Analysis, Duk University, 2003.
6 Bell D., “The Principles of Sorting,” Computer Journal of the Association for Computing Machinery, vol. 1, no. 2, pp. 71-77, 1958.
7 Box R. and Lacey S., “A Fast Easy Sort,”Computer Journal of Byte Magazine, vol. 16,no. 4, pp. 315- 315, 1991.
8 Deitel H. and Deitel P., C++ How to Program, Prentice Hall, 2001.
9 Friend E., “Sorting on Electronic ComputerSystems,” Computer Journal of ACM, vol. 3, no. 2, pp. 134-168, 1956.
10 Knuth D., The Art of Computer Programming,Addison Wesley, 1998.
11 Ledley R., Programming and Utilizing Digital Computers, McGraw Hill, 1962.
12 Levitin A., Introduction to the Design andAnalysis of Algorithms, Addison Wesley, 2007.
13 Nyhoff L., An Introduction to Data Structures, Nyhoff Publishers, Amsterdam, 2005.
14 Organick E., A FORTRAN Primer, AddisonWesley, 1963.
15 Pratt V., Shellsort and Sorting Networks,Garland Publishers, 1979.
16 Sedgewick R., “Analysis of Shellsort andRelated Algorithms,” in Proceedings of the 4th Annual European Symposium on Algorithms,pp. 1-11, 1996.
17 Seward H., “Information Sorting in theApplication of Electronic Digital Computers to Business Operations,” Masters Thesis, 1954.
18 Shell D., “A High Speed Sorting Procedure,”Computer Journal of Communications of the ACM, vol. 2, no. 7, pp. 30-32, 1959.
19 Thorup M., “Randomized Sorting in O(n log logn) Time and Linear Space Using Addition,Shift, and Bit Wise Boolean Operations,”Computer Journal of Algorithms, vol. 42, no. 2,pp. 205-230, 2002.
Mr. Hari Krishna Gurram
- India
Mr. Jaideep Gera
- India