Abstract
Sorting is arranging a collection of elements either in ascending or descending order. There are various applications of sorting algorithm in every field of computer science. Already there exist different sorting algorithms with different complexities. In worst case, the best known complexity is O (nlog n). We have an algorithm called RAPID SORT and analyzed in detail and also compared with some of the existing algorithm like the Quick Sort, Merge sort, Bubble sort, Insertion sort, and selection sort. This algorithm is much better for closely related datasets. This algorithm is very efficient to sort the elements in reverse order.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Langsam, Y., Augenstein, M.J., Tenenbaum, A.M.: Data Structures Using C and C++, pp. 355–358. Pearson Prentice Hall, New Delhi (2007)
Astrachan, O.: Bubble sort: an archaeological algorithmic analysis. SIGCSE 2003 Hannan Akhtar. Available at: http://www.cs.duke.edu/~ola/papers/bubble.pdf
Robert, S.: Algorithms, (chapter 8, p. 95). Addison-Wesley, MA (1983)
Langsam, Y., Augenstein, M.J., Tenenbaum, A.M.: Data Structures Using C and C++, pp. 381–382. Pearson Prentice Hall, New Delhi (2007)
Langsam, Y., Augenstein, M.J., Tenenbaum, A.M.: Data Structures Using C and C++, pp. 367–368. Pearson Prentice Hall, New Delhi (2007)
Srivastava, S.K., Srivastava, D.: Data Structures Through C in Depth, pp. 421–424. BPB Publication, New York (2011)
Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn., pp. 145–148. PHI
Srivastava, S.K., Srivastava, D.: Data Structures Through C in Depth, pp. 358–364. BPB Publication, New York (2007)
Horowitz, E, Sahni, S, Rajasekaran, S.: Fundamentals of Computer Algorithms, pp. 159–167. University Press (2009)
Srivastava, S.K., Srivastava, D.: Data Structures Through C in Depth, pp. 434–444. BPB Publication, New York (2011)
Langsam, Y., Augenstein, M.J., Tenenbaum, A.M.: Data Structures Using C and C++, pp. 403–405. Pearson Prentice Hall, New Delhi (2007)
Srivastava, S.K., Srivastava, D.: Data Structures Through C in Depth, pp. 472–473. BPB Publication, New York (2011)
Langsam, Y., Augenstein, M.J., Tenenbaum, A.M.: Data Structures Using C and C++, pp. 410–413. Pearson Prentice Hall, New Delhi (2007)
Srivastava, S.K., Srivastava, D.: Data Structures Through C in Depth, pp. 473–476. BPB Publication, New York (2011)
Langsam, Y., Augenstein, M.J., Tenenbaum, A.M.: Data Structures Using C and C++, pp. 202–207. Pearson Prentice Hall, New Delhi (2007)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer India
About this paper
Cite this paper
Singh, H.R., Sarmah, M. (2015). Comparing Rapid Sort with Some Existing Sorting Algorithms. In: Das, K., Deep, K., Pant, M., Bansal, J., Nagar, A. (eds) Proceedings of Fourth International Conference on Soft Computing for Problem Solving. Advances in Intelligent Systems and Computing, vol 335. Springer, New Delhi. https://doi.org/10.1007/978-81-322-2217-0_49
Download citation
DOI: https://doi.org/10.1007/978-81-322-2217-0_49
Published:
Publisher Name: Springer, New Delhi
Print ISBN: 978-81-322-2216-3
Online ISBN: 978-81-322-2217-0
eBook Packages: EngineeringEngineering (R0)