Skip to main content
SpringerLink
Log in
Book cover

Proceedings of Fourth International Conference on Soft Computing for Problem Solving pp 609–618Cite as

Comparing Rapid Sort with Some Existing Sorting Algorithms

  • Conference paper
  • First Online:

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 335))

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.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Langsam, Y., Augenstein, M.J., Tenenbaum, A.M.: Data Structures Using C and C++, pp. 355–358. Pearson Prentice Hall, New Delhi (2007)

    Google Scholar 

  2. Astrachan, O.: Bubble sort: an archaeological algorithmic analysis. SIGCSE 2003 Hannan Akhtar. Available at: http://www.cs.duke.edu/~ola/papers/bubble.pdf

  3. Robert, S.: Algorithms, (chapter 8, p. 95). Addison-Wesley, MA (1983)

    Google Scholar 

  4. Langsam, Y., Augenstein, M.J., Tenenbaum, A.M.: Data Structures Using C and C++, pp. 381–382. Pearson Prentice Hall, New Delhi (2007)

    Google Scholar 

  5. Langsam, Y., Augenstein, M.J., Tenenbaum, A.M.: Data Structures Using C and C++, pp. 367–368. Pearson Prentice Hall, New Delhi (2007)

    Google Scholar 

  6. Srivastava, S.K., Srivastava, D.: Data Structures Through C in Depth, pp. 421–424. BPB Publication, New York (2011)

    Google Scholar 

  7. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn., pp. 145–148. PHI

    Google Scholar 

  8. Srivastava, S.K., Srivastava, D.: Data Structures Through C in Depth, pp. 358–364. BPB Publication, New York (2007)

    Google Scholar 

  9. Horowitz, E, Sahni, S, Rajasekaran, S.: Fundamentals of Computer Algorithms, pp. 159–167. University Press (2009)

    Google Scholar 

  10. Srivastava, S.K., Srivastava, D.: Data Structures Through C in Depth, pp. 434–444. BPB Publication, New York (2011)

    Google Scholar 

  11. Langsam, Y., Augenstein, M.J., Tenenbaum, A.M.: Data Structures Using C and C++, pp. 403–405. Pearson Prentice Hall, New Delhi (2007)

    Google Scholar 

  12. Srivastava, S.K., Srivastava, D.: Data Structures Through C in Depth, pp. 472–473. BPB Publication, New York (2011)

    Google Scholar 

  13. Langsam, Y., Augenstein, M.J., Tenenbaum, A.M.: Data Structures Using C and C++, pp. 410–413. Pearson Prentice Hall, New Delhi (2007)

    Google Scholar 

  14. Srivastava, S.K., Srivastava, D.: Data Structures Through C in Depth, pp. 473–476. BPB Publication, New York (2011)

    Google Scholar 

  15. Langsam, Y., Augenstein, M.J., Tenenbaum, A.M.: Data Structures Using C and C++, pp. 202–207. Pearson Prentice Hall, New Delhi (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, Assam Down Town University, Guwahati, India

    Heisnam Rohen Singh & Mriganka Sarmah

Authors
  1. Heisnam Rohen Singh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mriganka Sarmah
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Heisnam Rohen Singh .

Editor information

Editors and Affiliations

  1. Mathematics, National Institute of Technology Silchar, Silchar, Assam, India

    Kedar Nath Das

  2. Department of Mathematics, Indian Institute of Technology Roorkee, Roorkee, India

    Kusum Deep

  3. Department of Paper Technology, Indian Institute of Technology Roorkee, Roorkee, India

    Millie Pant

  4. Department of Mathematics, South Asian University, New Delhi, India

    Jagdish Chand Bansal

  5. Department of Computer Science, Liverpool Hope University, Liverpool, United Kingdom

    Atulya Nagar

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics

Search

Navigation