Abstract
Sorting algorithm remained hot topic in computer science from the birth of computer science to achieve maximum performance. Fortunately this achievement became possible due to good and fast sorting algorithms, such as heap sort, merge sort, radix sort and other sorting algorithms. Till this achievement is also under research to find more efficient algorithms. In sorting algorithm arrays and link list data structures are commonly used. We know arrays are efficient if we need consecutive kind of data structure and link lists are useful when we need to add and remove items in the data structure. In other word we can say both data structures have own its merits and demerits. So in our sorting algorithm we are going to use both kinds of data structure. We will use in our MainIndex sorting algorithm arrays as the MainIndex and link list as sorting cells. MainIdex sorting algorithm need some kind of information just the length of the number which is going to sort and the value of the number which is going to sort in sorting cell.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Mishra, A.D.: Selection of best sorting algorithm for a particular problem, Thapar University Patiala (2009)
Grover, R.S.: Programming with Java: A Multimedia Approach. Jones & Bartlett Publishers, Burlington (2011)
Drozdek, A.: Data Structures and Algorithms in C++. Cengage Learning, Boston (2012)
Puntambekar, A.A.: Data Structures and Algorithms. Technical Publications, Pune (2009)
Rolim, J.: Parallel and distributed processing: In: Proceedings of 15 IPDPS 2000 Workshops Cancun, Mexico, 1–5 May 2000. Springer (2003)
Cormen, T.H.: Algorithms Unlocked. Mit Press, Cambridge (2013)
Dale, N., Walker, H.M.: Abstract Data Types: Specifications, Implementations, and Applications. Jones & Bartlett Learning, Burlington (1996)
Karloff, H.: Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, vol. 95. SIAM (1998)
Sametinger, J.: Software Engineering with Reusable Components. Springer Science & Business Media, Heidelberg (1997)
Applegate, D., Brodal, G., Panario, D., Sedgewick, R.: Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments and the Fourth Workshop on Analytic Algorithms and Combinatorics (2007)
Marciniak, J.J.: Encyclopedia of Software Engineering, vol. 2 OZ. Wiley-Interscience, Hoboken (1994)
Farrell, J.: Object-Oriented Programming Using C++. Cengage Learning, Boston (2008)
Beu, T.A.: Introduction to Numerical Programming: A Practical Guide for Scientists and Engineers Using Python and C/C++. CRC Press, Boca Raton (2014)
Mehlhorn, K.: Data Structures and Algorithms 1: Sorting and Searching, vol. 1. Springer Science & Business Media, Berlin (2013)
Deckard, A., Anafi, R.C., Hogenesch, J.B., Haase, S.B., Harer, J.: Design and analysis of large-scale biological rhythm studies: a comparison of algorithms for detecting periodic signals in biological data. Bioinformatics 29, 3174–3180 (2013)
Cerri, S.A., Clancey, W.J., Papadourakis, G., Panourgia, K.K.: Intelligent tutoring systems. In: Proceedings of 11th International Conference, ITS 2012, Chania, Crete, Greece, 14–18 June 2012, vol. 7315. Springer (2012)
Cuesta-Infante, A., Colmenar, J.M., Bankovic, Z., Risco-MartÃn, J.L., Zapater, M., Hidalgo, J.I., et al.: Comparative study of meta-heuristic 3D floorplanning algorithms. Neurocomputing 150, 67–81 (2015)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG
About this paper
Cite this paper
Ahmed, A., Arif, M., Rizwan, A.R., Jabbar, M., Ahmed, Z., Ullah, M.S. (2018). MainIndex Sorting Algorithm. In: Balas, V., Jain, L., Balas, M. (eds) Soft Computing Applications. SOFA 2016. Advances in Intelligent Systems and Computing, vol 633. Springer, Cham. https://doi.org/10.1007/978-3-319-62521-8_20
Download citation
DOI: https://doi.org/10.1007/978-3-319-62521-8_20
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-62520-1
Online ISBN: 978-3-319-62521-8
eBook Packages: EngineeringEngineering (R0)