Skip to main content

An Improved Bubble Sort Method - Marking Bubble Sort

  • Conference paper
  • First Online:
Cyber Security Intelligence and Analytics (CSIA 2021)

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

Abstract

The advent of the era of big data requires high efficiency of data algorithm execution. In the data structure, the traditional bubble sort execution efficiency is low, by studying an improved bubble sort-mark bubble sort method, the number of executions can be reduced from 8 to 3, which greatly improves the execution efficiency of the algorithm.

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

Access this chapter

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

Institutional subscriptions

References

  1. Min, W.: Improved bidirectional selection sorting algorithm. Inf. Technol. 20, 295–296 (2019). (in Chinese)

    Google Scholar 

  2. Chunxia, Y., Wenzheng, D.: Discussion on the second-way choice sequence. J. Yellow River Univ. Sci. Technol. 10 12−13 (2020) (in Chinese)

    Google Scholar 

  3. Min Min, Y., Chee-gang, T.: An improved numbering - based selective sorting method. Sci. Technol. Eng. 25, 68–69 (2018). (in Chinese)

    Google Scholar 

  4. Wenzhong, L.: An improvement based on bubble sort algorithm. J. Wuzhou Coll. 10, 15–16 (2019). (in Chinese)

    Google Scholar 

  5. Fang, R., Yanyan, P., Qian, W.U.: Research on double bubbling algorithm. Inf. Comput. (Theoretical) 5, 80 (2020). (in Chinese)

    Google Scholar 

  6. Bang, Y., Li-liang, R., Ying-qing, H.: Hierarchical filling algorithm of digital elevation model based on rapid sorting. Comput. Appl. 2, 295–296 (2018). (in Chinese)

    Google Scholar 

  7. Yun, H.: A comparison of several fast sort algorithms. J. Anqing Normal Univ. (Nat. Sci. ed.) 10, 10–11 (2019). (in Chinese)

    Google Scholar 

  8. An overview of array sorting methods. The exam week 12, 25–26 (2020). (in Chinese)

    Google Scholar 

  9. Pengfei, W., Zhiming, H., Tieying, Z.: Analysis and design of ETT automatic generation algorithm in examination system. Computer Age 18, 285 (2017). (in Chinese)

    Google Scholar 

  10. Dianying, C.: Evaluation of HEAPSORT algorithm. J. Shaoguan Univ. 5, 195–196 (2020). (in Chinese)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Rui Jin .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Zhang, J., Jin, R. (2021). An Improved Bubble Sort Method - Marking Bubble Sort. In: Xu, Z., Parizi, R.M., Loyola-González, O., Zhang, X. (eds) Cyber Security Intelligence and Analytics. CSIA 2021. Advances in Intelligent Systems and Computing, vol 1342. Springer, Cham. https://doi.org/10.1007/978-3-030-70042-3_121

Download citation

Publish with us

Policies and ethics