{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T20:17:04Z","timestamp":1775679424301,"version":"3.50.1"},"reference-count":117,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T00:00:00Z","timestamp":1762128000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T00:00:00Z","timestamp":1762128000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Vellore Institute of Technology, Vellore"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Discov Computing"],"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>With the exponential growth of digital data, efficient sorting techniques has becomes essential for real-time and large-scale computing applications. This review systematically evaluates the performance and computational complexity of twelve classical sorting techniques. This study considers both theoretical aspects, such as time, space complexity, and algorithmic stability, and complements them with empirical analysis using the MATLAB platform. Execution times were benchmarked across a variety of data types, including positive and negative integers, decimal numbers, and characters, over data sizes ranging from 100 to 100,000 elements. Results indicate that the bucket sort delivers the fastest performance for uniformly distributed numeric and character data, while the counting sort excels with positive integers. Merge and heap sort provide stable and scalable performance across data volumes due to their consistent O(n log n) complexity. In contrast, simpler sorting techniques, such as bubble and selection sorting, show significant inefficiency on larger data sizes. This study bridges the gap between theoretical analysis and empirical behavior, offering practical insight to help researchers and developers select optimal sorting techniques based on specific application needs and input characteristics.<\/jats:p>","DOI":"10.1007\/s10791-025-09724-w","type":"journal-article","created":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T09:25:50Z","timestamp":1762161950000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A systematic analysis on performance and computational complexity of sorting algorithms"],"prefix":"10.1007","volume":"28","author":[{"given":"Sureshkumar","family":"Sundaramoorthy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Govardhan","family":"Karunanidhi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,11,3]]},"reference":[{"key":"9724_CR1","doi-asserted-by":"publisher","unstructured":"Armend S, Hoti MH, Hoti. A. H. A Review of Performance and Complexity on Sorting Algorithms. 2022 International Conference on Computing, Networking, Telecommunications and Engineering Sciences Applications (CoNTESA) 2022;45\u201350 https:\/\/doi.org\/10.1109\/contesa57046.2022.10011382","DOI":"10.1109\/contesa57046.2022.10011382"},{"key":"9724_CR2","unstructured":"Cormen TH, Charles ELRRL, Stein C. Introduction to algorithms. (The Mit Press, 2022)."},{"key":"9724_CR3","first-page":"55","volume":"07","author":"A Jehad","year":"2010","unstructured":"Jehad A, Rami M. An enhancement of major sorting algorithms. Int Arab J Inf Technol. 2010;07:55\u201362.","journal-title":"Int Arab J Inf Technol"},{"key":"9724_CR4","first-page":"363","volume":"2","author":"AD Mishra","year":"2008","unstructured":"Mishra AD, Garg D. Selection of best sorting algorithm. Int J Intell Inf Process. 2008;2:363\u20138.","journal-title":"Int J Intell Inf Process"},{"key":"9724_CR5","doi-asserted-by":"publisher","DOI":"10.2139\/ssrn.3568396","author":"S Kumar","year":"2020","unstructured":"Kumar S. An empirical study on algorithms - conquer sorting techniques. SSRN Electron J. 2020. https:\/\/doi.org\/10.2139\/ssrn.3568396.","journal-title":"SSRN Electron J"},{"key":"9724_CR6","doi-asserted-by":"publisher","first-page":"143","DOI":"10.5539\/mas.v12n4p143","volume":"12","author":"S AL-Azzam","year":"2018","unstructured":"AL-Azzam S, Qatawneh M. Parallel processing of sorting and searching algorithms comparative study. Mod Appl Sci. 2018;12:143.","journal-title":"Mod Appl Sci"},{"key":"9724_CR7","first-page":"930","volume":"14","author":"N Akhter","year":"2016","unstructured":"Akhter N, Idrees M, Furqan-ur-Rehman. Sorting algorithms - a comparative study. Int J Comput Sci Inf Secur. 2016;14:930\u20136.","journal-title":"Int J Comput Sci Inf Secur"},{"key":"9724_CR8","doi-asserted-by":"publisher","first-page":"620","DOI":"10.1145\/359024.359026","volume":"23","author":"CR Cook","year":"1980","unstructured":"Cook CR, Kim DJ. Best sorting algorithm for nearly sorted lists. Commun ACM. 1980;23:620\u20134.","journal-title":"Commun ACM"},{"key":"9724_CR9","volume":"1","author":"A Zutshi","year":"2021","unstructured":"Zutshi A, Goswami D. Systematic review and exploration of new avenues for sorting algorithm. Int J Inf Manag Data Insights. 2021;1:100042.","journal-title":"Int J Inf Manag Data Insights"},{"key":"9724_CR10","doi-asserted-by":"publisher","first-page":"23","DOI":"10.5958\/2231-3915.2016.00006.7","volume":"6","author":"D Rajagopal","year":"2016","unstructured":"Rajagopal D, Thilakavalli K. Comparison of different sorting algorithms in data structure based upon the time complexity. Int J Technol. 2016;6:23.","journal-title":"Int J Technol"},{"key":"9724_CR11","first-page":"254","volume":"36","author":"MM Karimizadeh","year":"2015","unstructured":"Karimizadeh MM, Rafeazadeh E, Amiri P, Kholghnik D. Enhancing and optimization sorting algorithms: an empirical study. Cumhuriyet Sci J. 2015;36:254\u201366.","journal-title":"Cumhuriyet Sci J"},{"key":"9724_CR12","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1109\/icimtech.2016.7930334","volume":"2016","author":"R Setiawan","year":"2016","unstructured":"Setiawan R. Comparing sorting algorithm complexity based on control flow structure. Int Conf Inf Manag Technol. 2016;2016:224\u20138. https:\/\/doi.org\/10.1109\/icimtech.2016.7930334.","journal-title":"Int Conf Inf Manag Technol"},{"key":"9724_CR13","first-page":"63","volume":"5","author":"A Ali","year":"2016","unstructured":"Ali, et al. Comparison of different sorting algorithm. Int J Adv Res Comput Sci Electron Eng. 2016;5:63\u201371.","journal-title":"Int J Adv Res Comput Sci Electron Eng"},{"key":"9724_CR14","first-page":"25","volume":"2","author":"AM Aliyu","year":"2013","unstructured":"Aliyu AM, Zirra PB. A comparative analysis of sorting algorithms on integer and character arrays. Int J Eng Sci(IJES). 2013;2:25\u201330.","journal-title":"Int J Eng Sci(IJES)"},{"key":"9724_CR15","first-page":"204","volume":"2","author":"S Kaur","year":"2013","unstructured":"Kaur S. Study of sorting algorithm to optimize search results. Int J Emerg Trends Technol Comput Sci. 2013;2:204\u20137.","journal-title":"Int J Emerg Trends Technol Comput Sci"},{"key":"9724_CR16","first-page":"120","volume":"7","author":"KS Al-Kharabsheh","year":"2013","unstructured":"Al-Kharabsheh KS, AlTurani IM, AlTurani AMI, Zanoon NI. Review on sorting algorithms a comparative study. Int J Comput Sci Secur. 2013;7:120\u20136.","journal-title":"Int J Comput Sci Secur"},{"key":"9724_CR17","doi-asserted-by":"publisher","unstructured":"Peng Q. Bubble Sort and Its Improved Methods. 2023 IEEE 3rd International Conference on Data Science and Computer Application (ICDSCA) 2023;367\u2013370 https:\/\/doi.org\/10.1109\/icdsca59871.2023.10393066","DOI":"10.1109\/icdsca59871.2023.10393066"},{"key":"9724_CR18","first-page":"2709","volume":"65","author":"P Ganapathi","year":"2021","unstructured":"Ganapathi P, Chowdhury R. Parallel divide-and-conquer algorithms for bubble sort, selection sort and insertion sort. Comput J. 2021;65:2709\u201319.","journal-title":"Comput J"},{"key":"9724_CR19","doi-asserted-by":"publisher","first-page":"4895","DOI":"10.32604\/cmc.2022.023837","volume":"71","author":"KI Rahmani","year":"2022","unstructured":"Rahmani KI, M. Smart bubble sort: a novel and dynamic variant of bubble sort algorithm. Comput Mater Continua. 2022;71:4895\u2013913.","journal-title":"Comput Mater Continua"},{"key":"9724_CR20","doi-asserted-by":"publisher","first-page":"680","DOI":"10.30534\/ijatcse\/2021\/311022021","volume":"10","author":"SM Aqib","year":"2021","unstructured":"Aqib SM, Nawaz H, Butt SM. Analysis of merge sort and bubble sort in python, php, javascript, and c language. Int J Adv Trends Comput Sci Eng. 2021;10:680\u20136.","journal-title":"Int J Adv Trends Comput Sci Eng"},{"key":"9724_CR21","doi-asserted-by":"crossref","unstructured":"Edjlal R, Edjlal A, Moradi T. A sort implementation comparing with Bubble sort and Selection sort. IEEE Xplore 2011;vol. 4 380\u2013381 https:\/\/ieeexplore.ieee.org\/document\/5763927.","DOI":"10.1109\/ICCRD.2011.5763927"},{"key":"9724_CR22","unstructured":"Min W. Analysis on Bubble Sort Algorithm Optimization. IEEE Xplore 2010;vol. 1 208\u2013211 https:\/\/ieeexplore.ieee.org\/abstract\/document\/5635119?casa-token=yRpXS-rtAjgAAAAA:lLOKuCmVsKJZdiEAfg5P-6YK-D0Nx29E-M6-SFypPzroT9eHrYpBWOli-Ativpvx6fPZMSF6chE."},{"key":"9724_CR23","doi-asserted-by":"publisher","first-page":"36","DOI":"10.14445\/22312803\/IJCTT-V14P109","volume":"14","author":"H Rohil","year":"2014","unstructured":"Rohil H, sha, M. Run time bubble sort - an enhancement of bubble sort. Int J Comput Trends Technol. 2014;14:36\u20138.","journal-title":"Int J Comput Trends Technol"},{"key":"9724_CR24","first-page":"31","volume":"45","author":"N Arora","year":"2012","unstructured":"Arora N, Nirmal J, Tamta VK. A novel sorting algorithm and comparison with bubble sort and insertion sort. Int J Comput Appl. 2012;45:31\u20132.","journal-title":"Int J Comput Appl"},{"key":"9724_CR25","doi-asserted-by":"publisher","first-page":"1020","DOI":"10.30534\/ijatcse\/2021\/761022021","volume":"10","author":"FA Agha","year":"2021","unstructured":"Agha FA, Nawaz H. Comparison of bubble and insertion sort in rust and python language. Int J Adv Trends Comput Sci Eng. 2021;10:1020\u20135.","journal-title":"Int J Adv Trends Comput Sci Eng"},{"key":"9724_CR26","first-page":"30","volume":"5","author":"S Kumar","year":"2019","unstructured":"Kumar S, Singla P. Sorting using a combination of bubble sort, selection sort and counting sort. Int J Math Sci Comput. 2019;5:30\u201343.","journal-title":"Int J Math Sci Comput"},{"key":"9724_CR27","doi-asserted-by":"publisher","unstructured":"Paul T. Enhancement of Bubble and Insertion Sort Algorithm Using Block Partitioning. 25th International Conference on Computer and Information Technology IEEE 2022;412\u2013417 https:\/\/doi.org\/10.1109\/iccit57492.2022.10055404","DOI":"10.1109\/iccit57492.2022.10055404"},{"key":"9724_CR28","first-page":"2","volume":"11","author":"R Saadeh","year":"2019","unstructured":"Saadeh R, Qatawneh M. Performance Evaluation of Parallel Bubble Sort Algorithm on Supercomputer IMAN1. Int J Comput Sci Inf Technol. 2019;11:2.","journal-title":"Int J Comput Sci Inf Technol"},{"key":"9724_CR29","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1360\/crad20070222","volume":"44","author":"L Yang","year":"2007","unstructured":"Yang L. The array-based bucket sort algorithm. J Comput Res Dev. 2007;44:341.","journal-title":"J Comput Res Dev"},{"key":"9724_CR30","doi-asserted-by":"publisher","unstructured":"Khurana M, Neetu F, Shipra S. Hybrid bucket sort switching internal sorting based on the data inside the bucket. International Conference on Reliability, Infocom Technologies and Optimization (Trends and Future Directions)(ICRITO) 2017;476\u2013482 https:\/\/doi.org\/10.1109\/icrito.2017.8342474","DOI":"10.1109\/icrito.2017.8342474"},{"key":"9724_CR31","first-page":"22","volume":"175","author":"A Fenyi","year":"2020","unstructured":"Fenyi A, Fosu M, Appiah B. Comparative analysis of comparison and non comparison based sorting algorithms. Int J Comput Appl. 2020;175:22\u20135.","journal-title":"Int J Comput Appl"},{"key":"9724_CR32","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1007\/s002360050103","volume":"34","author":"A Burnetas","year":"1997","unstructured":"Burnetas A, Solow D, Agarwal R. An analysis and implementation of an efficient in-place bucket sort. Acta Inf. 1997;34:687\u2013700.","journal-title":"Acta Inf"},{"key":"9724_CR33","doi-asserted-by":"publisher","unstructured":"Neetu F, Shipra S. The detailed experimental analysis of bucket sort. In 2017 7th International Conference on Cloud Computing, Data Science and Engineering-Confluence 2017;1\u20136 https:\/\/doi.org\/10.1109\/confluence.2017.7943114","DOI":"10.1109\/confluence.2017.7943114"},{"key":"9724_CR34","doi-asserted-by":"publisher","unstructured":"Goel A, Sharma A, Gupta N. A variant of Bucket Sort Shell Sort vs Insertion Sort. International Conference on Computing, Communication and Networking Technologies (ICCCNT) 2019;1\u20135 https:\/\/doi.org\/10.1109\/icccnt45670.2019.8944607","DOI":"10.1109\/icccnt45670.2019.8944607"},{"key":"9724_CR35","unstructured":"Horsmalahti P. Comparison of Bucket Sort and Radix Sort. CoRR abs\/1206.3511, 2012;."},{"key":"9724_CR36","doi-asserted-by":"publisher","first-page":"21","DOI":"10.4316\/JACSM.202101003","volume":"15","author":"C Komalasari","year":"2021","unstructured":"Komalasari c, Istiono. W. A,. Comparative Study of Cocktail Sort and Insertion Sort. J Appl Comput Sci Math. 2021;15:21\u20135.","journal-title":"J Appl Comput Sci Math"},{"key":"9724_CR37","first-page":"1387","volume":"4","author":"AH Elkahlout","year":"2017","unstructured":"Elkahlout AH, Ashraf. A comparative Study of Sorting Algorithms Comb, Cocktail and Counting Sorting. Int Res J Eng Technol(IRJET). 2017;4:1387\u201390.","journal-title":"Int Res J Eng Technol(IRJET)"},{"key":"9724_CR38","doi-asserted-by":"publisher","unstructured":"Sun W, Ma Z. Count sort for gpu computing. International Conference on Parallel and Distributed Systems. 2009;919\u2013924. DOI: https:\/\/doi.org\/10.1109\/icpads.2009.30.","DOI":"10.1109\/icpads.2009.30."},{"key":"9724_CR39","first-page":"1","volume":"98","author":"K Bajpai","year":"2014","unstructured":"Bajpai K, Kots A. Implementing and analyzing an efficient version of counting sort (e-counting sort). Int J Comput Appl. 2014;98:1\u20132.","journal-title":"Int J Comput Appl"},{"key":"9724_CR40","doi-asserted-by":"publisher","unstructured":"Usmani AR. A Novel Time and Space Complexity Efficient Variant of Counting-Sort Algorithm. IEEE Xplore 2019;1\u20136 https:\/\/ieeexplore.ieee.org\/abstract\/document\/8966717https:\/\/doi.org\/10.1109\/ICIC48496.2019.8966717","DOI":"10.1109\/ICIC48496.2019.8966717"},{"key":"9724_CR41","doi-asserted-by":"publisher","unstructured":"Kumar S, Madhu SG, Kumar K, Prem S.S. A Novel Counting Sort for Real Numberswith Linear Time Complexity. 2022 International Conference on Computational Intelligence and Sustainable Engineering Solutions (CISES) 2022;60\u201364 https:\/\/doi.org\/10.1109\/cises54857.2022.9844325","DOI":"10.1109\/cises54857.2022.9844325"},{"key":"9724_CR42","doi-asserted-by":"publisher","first-page":"57","DOI":"10.4236\/jcc.2017.512006","volume":"05","author":"H Li","year":"2017","unstructured":"Li H, Chen P, Wang Y. Heap sorting based on array sorting. J Comput Commun. 2017;05:57\u201362.","journal-title":"J Comput Commun"},{"key":"9724_CR43","doi-asserted-by":"publisher","first-page":"580","DOI":"10.30534\/ijeter\/2021\/08952021","volume":"9","author":"H Ali","year":"2021","unstructured":"Ali H, Nawaz H, Maitlo A, Soomro I. Performance analysis of heap sort and insertion sort algorithm. Int J Emerg Trends Eng Res. 2021;9:580\u20136.","journal-title":"Int J Emerg Trends Eng Res"},{"key":"9724_CR44","doi-asserted-by":"crossref","unstructured":"Marcellino M, Pratama DW, Suntiarko SS, Margi K. Comparative of Advanced Sorting Algorithms (Quick Sort, Heap Sort, Merge Sort, Intro Sort, Radix Sort) Based on Time and Memory Usage. IEEE Xplore 2021;vol. 1 154\u2013160 https:\/\/ieeexplore.ieee.org\/abstract\/document\/9609715.","DOI":"10.1109\/ICCSAI53272.2021.9609715"},{"key":"9724_CR45","first-page":"1143","volume":"2","author":"V Sharma","year":"2008","unstructured":"Sharma V, Sandhu PS, Singh S, Saini B. Analysis of modified heap sort algorithm on different environment. Int J Electr Comput Eng. 2008;2:1143\u20135.","journal-title":"Int J Electr Comput Eng"},{"key":"9724_CR46","doi-asserted-by":"publisher","unstructured":"Zhenhua W, Zhifeng L, Guoliang L. Parallel Optimization Strategy of Heap Sort Algorithm under Multi-core Environment. IEEE Xplore 2015;768\u2013771 https:\/\/ieeexplore.ieee.org\/stamp\/stamp.jsp?tp=&arnumber=7263684https:\/\/doi.org\/10.1109\/ICMTMA.2015.190","DOI":"10.1109\/ICMTMA.2015.190"},{"key":"9724_CR47","doi-asserted-by":"crossref","unstructured":"Taiwo OE, Christianah AO, Oluwatobi, AN, Aderonke KA, others. Comparative study of two divide and conquer sorting algorithms: quicksort and mergesort. Procedia Computer Science 2020;171, 2532\u20132540.","DOI":"10.1016\/j.procs.2020.04.274"},{"key":"9724_CR48","doi-asserted-by":"crossref","unstructured":"Vignesh R, Pradhan T. Merge sort enhanced in place sorting algorithm. in 2016 International Conference on Advanced Communication Control and Computing Technologies (ICACCCT) 2016;698\u2013704","DOI":"10.1109\/ICACCCT.2016.7831730"},{"key":"9724_CR49","first-page":"28","volume":"183","author":"I Mishal","year":"2021","unstructured":"Mishal I, AL-Khatib R, Hiasat R. Comparative Study of Two Divide and Conquer Sorting Algorithms: Modified Quick Sort and Merge Sort. Int J Comput Appl. 2021;183:28\u201333.","journal-title":"Int J Comput Appl"},{"key":"9724_CR50","doi-asserted-by":"crossref","unstructured":"Lobo J, Kuwelkar S. Performance analysis of merge sort algorithm. in 2020 International Conference on Electronics and Sustainable Communication Systems (ICESC) 2020;110\u2013115 (IEEE).","DOI":"10.1109\/ICESC48915.2020.9155623"},{"key":"9724_CR51","first-page":"1039","volume":"33","author":"Y Bai","year":"2013","unstructured":"Bai Y, Guo X. Efficient algorithm of depth-first stable in-place merge sort. J Comput Appl. 2013;33:1039\u201342.","journal-title":"J Comput Appl"},{"key":"9724_CR52","doi-asserted-by":"publisher","unstructured":"Uyar A. Parallel merge sort with double merging. IEEE Xplore 1\u20135 https:\/\/ieeexplore.ieee.org\/document\/7036012\/citations?tabFilter=papers#citations 2014; https:\/\/doi.org\/10.1109\/ICAICT.2014.7036012","DOI":"10.1109\/ICAICT.2014.7036012"},{"key":"9724_CR53","doi-asserted-by":"publisher","unstructured":"Panny W, Prodinger H. Bottom-up mergesort-a detailed analysis Algorithmica Springer. 1995;14:340\u201354. https:\/\/doi.org\/10.1109\/pdp.2007.10.","DOI":"10.1109\/pdp.2007.10"},{"key":"9724_CR54","first-page":"70","volume":"1","author":"KB Manwade","year":"2010","unstructured":"Manwade KB. Analysis of parallel merge sort algorithm. Int J Comput Appl. 2010;1:70\u20133.","journal-title":"Int J Comput Appl"},{"key":"9724_CR55","doi-asserted-by":"crossref","unstructured":"Wo\u017aniak M, Marsza\u0142ek Z, Gabryel M, Nowicki, R. Modified merge sort algorithm for large scale data sets. Artificial Intelligence and Soft Computing: 12th International Conference, ICAISC. Zakopane, poland, june 9\u201313, 2013, proceedings, part ii 12. Springer. 2013;2013:612\u201322.","DOI":"10.1007\/978-3-642-38610-7_56"},{"key":"9724_CR56","first-page":"19","volume":"21","author":"Z Marsza\u0142ek","year":"2017","unstructured":"Marsza\u0142ek Z. Performance tests on merge sort and recursive merge sort for big data processing. Tech Sci. 2017;21:19\u201335.","journal-title":"Tech Sci"},{"key":"9724_CR57","doi-asserted-by":"publisher","DOI":"10.1109\/csde56538.2022.10089293","author":"J Peeters","year":"2022","unstructured":"Peeters J, Haase J. Improving mergesort performance by optimizing branch prediction. IEEE Asia-Pacific Conference on Computer Science and Data Engineering. 2022. https:\/\/doi.org\/10.1109\/csde56538.2022.10089293.","journal-title":"IEEE Asia-Pacific Conference on Computer Science and Data Engineering"},{"key":"9724_CR58","first-page":"10","volume":"122","author":"R Renu","year":"2015","unstructured":"Renu R, Manisha M. Mq sort an innovative algorithm using quick sort and merge sort. Int J Comput Appl. 2015;122:10\u20134.","journal-title":"Int J Comput Appl"},{"key":"9724_CR59","doi-asserted-by":"publisher","unstructured":"Jiang D, Zhou MA. comparative study of insertion sorting algorithm verification. Ieee 2nd information technology, networking. Electronic and Automation Control Conference (ITNEC). 2017;2017. DOI: https:\/\/doi.org\/10.1109\/itnec.2017.8284998.","DOI":"10.1109\/itnec.2017.8284998."},{"key":"9724_CR60","first-page":"35","volume":"64","author":"T SinghSodhi","year":"2013","unstructured":"SinghSodhi T, Kaur S, Kaur S. Enhanced insertion sort algorithm. Int J Comput Appl. 2013;64:35\u20139.","journal-title":"Int J Comput Appl"},{"key":"9724_CR61","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1016\/j.csda.2012.08.008","volume":"58","author":"C Biernacki","year":"2013","unstructured":"Biernacki C, Jacques J. A generative model for rank data based on insertion sort algorithm. Comput Stat Data Anal. 2013;58:162\u201376.","journal-title":"Comput Stat Data Anal"},{"key":"9724_CR62","doi-asserted-by":"publisher","first-page":"2150024","DOI":"10.1142\/S0219467821500248","volume":"21","author":"A Kalaivani","year":"2020","unstructured":"Kalaivani A, Swetha K. An enhanced bidirectional insertion sort over classical insertion sort. Int J Image Graph. 2020;21:2150024.","journal-title":"Int J Image Graph"},{"key":"9724_CR63","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1016\/j.future.2017.01.034","volume":"71","author":"AS Mohammed","year":"2017","unstructured":"Mohammed AS, Amrahov \u015eE, \u015eelebi FV. Bidirectional conditional insertion sort algorithm; an efficient progress on the classical insertion sort. Futur Gener Comput Syst. 2017;71:102\u201312.","journal-title":"Futur Gener Comput Syst"},{"key":"9724_CR64","first-page":"14","volume":"57","author":"IS Rajput","year":"2012","unstructured":"Rajput IS, Suresh Kumar B, Singh T. Performance comparison of sequential quick sort and parallel quick sort algorithms. Int J Comput Appl. 2012;57:14\u201322.","journal-title":"Int J Comput Appl"},{"key":"9724_CR65","doi-asserted-by":"publisher","unstructured":"Frias L, Roura S. Multikey quickselect Algorithmica Springer. 2014;69:958\u201373. https:\/\/doi.org\/10.1109\/csde56538.2022.10089318.","DOI":"10.1109\/csde56538.2022.10089318"},{"key":"9724_CR66","doi-asserted-by":"crossref","unstructured":"Fouz M, Kufleitner M, Manthey B, Zeini JN. On smoothed analysis of quicksort and hoare\u2019s find. Algorithmica Springer. 2012;62:879\u2013905.","DOI":"10.1007\/s00453-011-9490-9"},{"key":"9724_CR67","doi-asserted-by":"publisher","first-page":"30","DOI":"10.9790\/0661-0733035","volume":"7","author":"D Manjunath","year":"2012","unstructured":"Manjunath D. T-sort: a tagging technique to optimize memory utilization in radix sort. IOSR J Comput Eng. 2012;7:30\u20135.","journal-title":"IOSR J Comput Eng"},{"key":"9724_CR68","doi-asserted-by":"crossref","unstructured":"NG W, KAKEHI K. Cache Efficient Radix Sort for String Sorting. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E90-A, 2007;457\u2013466.","DOI":"10.1093\/ietfec\/e90-a.2.457"},{"key":"9724_CR69","doi-asserted-by":"publisher","first-page":"20","DOI":"10.9790\/0661-0312023","volume":"3","author":"A Shukla","year":"2012","unstructured":"Shukla A. Modified pure radix sort for large heterogeneous data set. IOSR J Comput Eng. 2012;3:20\u20133.","journal-title":"IOSR J Comput Eng"},{"key":"9724_CR70","first-page":"29","volume":"110","author":"BJ Hayfron-Acquah","year":"2015","unstructured":"Hayfron-Acquah BJ, Appiah O, Riverson K. Improved selection sort algorithm. Int J Comput Appl. 2015;110:29\u201333.","journal-title":"Int J Comput Appl"},{"key":"9724_CR71","doi-asserted-by":"publisher","first-page":"1","DOI":"10.20469\/ijaps.5.50004-1","volume":"5","author":"RN Vilchez","year":"2019","unstructured":"Vilchez RN. Bidirectional enhanced selection sort algorithm technique. Int J Appl Phys Sci. 2019;5:1\u20137.","journal-title":"Int J Appl Phys Sci"},{"key":"9724_CR72","doi-asserted-by":"publisher","first-page":"93","DOI":"10.18178\/ijmlc.2020.10.1.904","volume":"10","author":"RN Vilchez","year":"2020","unstructured":"Vilchez RN. Modified selection sort algorithm employing boolean and distinct function in a bidirectional enhanced selection technique. Int J Mach Learn Comput. 2020;10:93\u20138.","journal-title":"Int J Mach Learn Comput"},{"key":"9724_CR73","doi-asserted-by":"crossref","unstructured":"Bilateral ZA, Sort S. International Journal for Research in Applied Science and Engineering Technology. 2020;8:230\u20136.","DOI":"10.22214\/ijraset.2020.7042"},{"key":"9724_CR74","doi-asserted-by":"publisher","unstructured":"He D. Some Improvements in Selection Sorting. In 2023 IEEE 3rd International Conference on Data Science and Computer Application (ICDSCA) 2023;371\u2013374 https:\/\/doi.org\/10.1109\/icdsca59871.2023.10393273","DOI":"10.1109\/icdsca59871.2023.10393273"},{"key":"9724_CR75","doi-asserted-by":"publisher","first-page":"2249","DOI":"10.30534\/ijatcse\/2021\/1071032021","volume":"10","author":"A Naz","year":"2021","unstructured":"Naz A, Nawaz H, Maitlo A, Hassan SM. Implementation of selection sort algorithm in various programming languages. Int J Adv Trends Comput Sci Eng. 2021;10:2249\u201355.","journal-title":"Int J Adv Trends Comput Sci Eng"},{"key":"9724_CR76","doi-asserted-by":"publisher","first-page":"43","DOI":"10.4314\/njbas.v29i1.5","volume":"29","author":"AM Rabiu","year":"2022","unstructured":"Rabiu AM, Garba EJ, Baha BY, Mukhtar MI. Comparative analysis between selection sort and merge sort algorithms. Nigerian J Basic Appl Sci. 2022;29:43\u20138.","journal-title":"Nigerian J Basic Appl Sci"},{"key":"9724_CR77","doi-asserted-by":"crossref","unstructured":"Stochastic analysis of shell sort. Smythe, robert t and wellner. J Algorithmica Springer. 2001;31:442\u201357.","DOI":"10.1007\/s00453-001-0048-0"},{"key":"9724_CR78","doi-asserted-by":"publisher","first-page":"61","DOI":"10.15388\/LMR.A.2013.14","volume":"54","author":"I Radavi\u010dius","year":"2013","unstructured":"Radavi\u010dius I, Baranauskas M. An empirical study of the gap sequences for shell sort. Lietuvos matematikos rinkinys. 2013;54:61\u20136.","journal-title":"Lietuvos matematikos rinkinys"},{"key":"9724_CR79","doi-asserted-by":"publisher","unstructured":"Yerram B, Bhonagiri JK. An Efficient Sorting Algorithm for binary data. IEEE Xplore 1\u20134 https:\/\/ieeexplore.ieee.org\/abstract\/document\/9225518 2020; https:\/\/doi.org\/10.1109\/ICCCNT49239.2020.9225518","DOI":"10.1109\/ICCCNT49239.2020.9225518"},{"key":"9724_CR80","unstructured":"Purvi P, Nikita B, Nirav B. Performance Comparison of Different Sorting Algorithms. International Journal of Latest Technology in Engineering, Management and Applied Science (IJLTEMAS) VI, 2017;39\u201341."},{"key":"9724_CR81","doi-asserted-by":"publisher","unstructured":"Santos BG, et\u00a0al. Asymptotic Analysis of the Running Time Performed by Various Sorting Algorithms. 2021 International Conference on Intelligent Technologies (CONIT) 2021; https:\/\/doi.org\/10.1109\/conit51480.2021.9498490","DOI":"10.1109\/conit51480.2021.9498490"},{"key":"9724_CR82","unstructured":"Kumar M, Malhotra MsM, Ahuja MsD. Minimising the Execution Time of Selection Sort Algorithm. International Journal Of Engineering And Computer Science 2015;6, 21."},{"key":"9724_CR83","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-63665-4-27","author":"GO Pizarro-Vasquez","year":"2020","unstructured":"Pizarro-Vasquez GO, Fabiola MM, Pierina GM, Botto-Tobar M. Sorting Algorithms and Their Execution Times an Empirical Evaluation. Adv Intell Syst Comput. 2020. https:\/\/doi.org\/10.1007\/978-3-030-63665-4-27.","journal-title":"Adv Intell Syst Comput"},{"key":"9724_CR84","doi-asserted-by":"crossref","unstructured":"Raheja S, Kukreja V. Enhancements in sorting algorithms: a review. journal of today\u2019s ideas - tomorrow\u2019s technologies 2015;3:73\u201382.","DOI":"10.15415\/jotitt.2015.31005"},{"key":"9724_CR85","doi-asserted-by":"publisher","unstructured":"Shabbir A, et\u00a0al. A Review of Algorithms\u2019s Complexities on Different Valued Sorted and Unsorted Data. International Conference on IT and Industrial Technologies (ICIT) 2023;1\u20136. https:\/\/doi.org\/10.1109\/icit59216.2023.10335840","DOI":"10.1109\/icit59216.2023.10335840"},{"key":"9724_CR86","first-page":"7","volume":"78","author":"A Bharadwaj","year":"2013","unstructured":"Bharadwaj A, Mishra S. Comparison of sorting algorithms based on input sequences. Int J Comput Appl. 2013;78:7\u201310.","journal-title":"Int J Comput Appl"},{"key":"9724_CR87","doi-asserted-by":"publisher","first-page":"113","DOI":"10.18280\/isi.250115","volume":"25","author":"S Buradagunta","year":"2020","unstructured":"Buradagunta S, Bodapati JD, Mundukur NB, Salma S. Performance comparison of sorting algorithms with random numbers as inputs. Ing\u00e9nierie des syst\u00e8mes d information. 2020;25:113\u20137.","journal-title":"Ing\u00e9nierie des syst\u00e8mes d information"},{"key":"9724_CR88","doi-asserted-by":"publisher","first-page":"21","DOI":"10.5121\/ijfcst.2015.5403","volume":"5","author":"A Kumari","year":"2015","unstructured":"Kumari A, Singh NK, Chakraborty S. A statistical comparative study of some sorting algorithms. Int J Found Comput Sci Technol. 2015;5:21\u20139.","journal-title":"Int J Found Comput Sci Technol"},{"key":"9724_CR89","doi-asserted-by":"crossref","unstructured":"Edelkamp S, Wei\u00df A, Wild S. Quickxsort: a fast sorting scheme in theory and practice. Algorithmica Springer. 2020;8:509\u201388.","DOI":"10.1007\/s00453-019-00634-0"},{"key":"9724_CR90","doi-asserted-by":"publisher","unstructured":"Durad MH, Akhtar MN, Irfan-ul-Haq. Performance Analysis of Parallel Sorting Algorithms Using MPI. IEEE Xplore. 2014;202\u2013207. https:\/\/ieeexplore.ieee.org\/document\/7118400https:\/\/doi.org\/10.1109\/FIT.2014.46","DOI":"10.1109\/FIT.2014.46"},{"key":"9724_CR91","doi-asserted-by":"crossref","unstructured":"Suresh A, George AK. Performance analysis of various combination sorting algorithms for large dataset to fit to a multi-core architecture. in 2018 second international conference on inventive communication and computational technologies (ICICCT) 2018;51\u201356.","DOI":"10.1109\/ICICCT.2018.8472956"},{"key":"9724_CR92","doi-asserted-by":"crossref","unstructured":"Durrani, OK, Abdulhayan, S. Performance Measurement of Popular Sorting Algorithms Implemented using Java and Python. in 2022 International Conference on Electrical, Computer, Communications and Mechatronics Engineering (ICECCME). 2022;1\u20136.","DOI":"10.1109\/ICECCME55909.2022.9988424"},{"key":"9724_CR93","doi-asserted-by":"publisher","unstructured":"Durrani OK, Farooqi AS, Chinmai AG, Prasad KS. Performances of Sorting Algorithms in Popular Programming Languages. IEEE Xplore. 2022;1\u20137 https:\/\/ieeexplore.ieee.org\/abstract\/document\/10084261\/https:\/\/doi.org\/10.1109\/SMARTGENCON56628.2022.10084261","DOI":"10.1109\/SMARTGENCON56628.2022.10084261"},{"key":"9724_CR94","doi-asserted-by":"publisher","unstructured":"Faujdar N, Ghrera SP. Analysis and Testing of Sorting Algorithms on a Standard Dataset. IEEE Xplore 962\u2013967 https:\/\/ieeexplore.ieee.org\/abstract\/document\/7280062\/ (2015) https:\/\/doi.org\/10.1109\/CSNT.2015.98","DOI":"10.1109\/CSNT.2015.98"},{"key":"9724_CR95","doi-asserted-by":"publisher","unstructured":"Hoda O, Omar Y, Badr. A. Mapping sorting algorithm. 2016 SAI Computing Conference (SAI) 2016; https:\/\/doi.org\/10.1109\/sai.2016.7556025","DOI":"10.1109\/sai.2016.7556025"},{"key":"9724_CR96","first-page":"535","volume":"2","author":"I Lakshmi Dr","year":"2018","unstructured":"Lakshmi Dr I. Performance Analysis of Four Different Types of Sorting Algorithms using Different Languages. Int J Trend Sci Res Dev. 2018;2:535\u201341.","journal-title":"Int J Trend Sci Res Dev"},{"key":"9724_CR97","doi-asserted-by":"publisher","unstructured":"Dawood AS, Abburu KS. BQM Hybrid Sorting Algorithm. International Conference on Computation System and Information Technology for Sustainable Solutions (CSITSS). 2023;1\u20135. https:\/\/doi.org\/10.1109\/csitss60515.2023.10334130","DOI":"10.1109\/csitss60515.2023.10334130"},{"key":"9724_CR98","doi-asserted-by":"crossref","unstructured":"Han Y. Sorting real numbers in O (n log n) time and linear space. Algorithmica, Springer. 2020;82 966-978.","DOI":"10.1007\/s00453-019-00626-0"},{"key":"9724_CR99","doi-asserted-by":"publisher","unstructured":"Pinnamaraju C. Binary Search Sort Algorithm -Yet Another Sorting Algorithm with Binary Search having O(nlogn) and O(n) time complexity. 2023 1st International Conference on Optimization Techniques for Learning (ICOTL) 2023;1\u20136 https:\/\/doi.org\/10.1109\/icotl59758.2023.10435020","DOI":"10.1109\/icotl59758.2023.10435020"},{"key":"9724_CR100","doi-asserted-by":"publisher","unstructured":"Goel K, Dwivedi P, Sharma O. Performance Analysis of Various Sorting Algorithms: Comparison and Optimization. 2023 11th International Conference on Intelligent Systems and Embedded Design (ISED) 2023;1\u20135 https:\/\/doi.org\/10.1109\/ised59382.2023.10444609.","DOI":"10.1109\/ised59382.2023.10444609"},{"key":"9724_CR101","doi-asserted-by":"publisher","unstructured":"Dutta A, et\u00a0al. Computational Time Complexity for Sorting Algorithm amalgamated with Quantum Search. 2023 International Conference for Advancement in Technology (ICONAT) 1\u20136 (2023) https:\/\/doi.org\/10.1109\/iconat57137.2023.10080217","DOI":"10.1109\/iconat57137.2023.10080217"},{"key":"9724_CR102","doi-asserted-by":"crossref","unstructured":"Bingmann T, Eberle A, Sanders P. Engineering parallel string sorting, Algorithmica,Springer 235\u2013286 (2017)","DOI":"10.1007\/s00453-015-0071-1"},{"key":"9724_CR103","unstructured":"Brian M. Sorting Methods. www.mathworks.com"},{"key":"9724_CR104","unstructured":"Singla S, Mangla D, Rani S, Modibbo, UM. Impact of preventive maintenance and failure rate on a complexly configured system: A sensitive analysis. Reliability: Theory & Applications 2024;19(4(80)), 774\u2013791."},{"key":"9724_CR105","doi-asserted-by":"crossref","unstructured":"Ro\u015fca, C-M, C\u0103rbureanu, M. A Comparative Analysis of Sorting Algorithms for Large-Scale Data: Performance Metrics and Language Efficiency. International Conference on Emerging Trends and Technologies on Intelligent Systems, Singapore: Springer Nature Singapore, 2024 ; pp. 99-113.","DOI":"10.1007\/978-981-97-5703-9_8"},{"issue":"2","key":"9724_CR106","doi-asserted-by":"publisher","first-page":"67","DOI":"10.9734\/jamcs\/2025\/v40i21970","volume":"40","author":"NS Abuba","year":"2025","unstructured":"Abuba NS, Baagyere EY, Nakpih CI, Wiredu JK. Optiflexsort: a hybrid sorting algorithm for efficient large-scale data processing. J Adv Math Comput Sci. 2025;40(2):67\u201381.","journal-title":"J Adv Math Comput Sci"},{"key":"9724_CR107","doi-asserted-by":"crossref","unstructured":"Rizvi, QM, Rai H, Jaiswal R. Sorting Algorithms in Focus: A Critical Examination of Sorting Algorithm Performance. Emerging Trends in IoT and Computing Technologies, 2024;103-106.","DOI":"10.1201\/9781003535423-19"},{"key":"9724_CR108","unstructured":"Sabah AS, Abu-Naser, SS, Helles YE, Abdallatif RF, Samra, FYAA, Taha AHA, Massa, NM, amouda, AA. Comparative analysis of the performance of popular sorting algorithms on datasets of different sizes and characteristics. 2023;."},{"issue":"2","key":"9724_CR109","volume":"1","author":"A Zutshi","year":"2021","unstructured":"Zutshi A, Goswami D. Systematic review and exploration of new avenues for sorting algorithm. Int J Inf Manag Data Insights Elsevier. 2021;1(2):100042.","journal-title":"Int J Inf Manag Data Insights Elsevier"},{"key":"9724_CR110","first-page":"114","volume":"3","author":"Y Chauhan","year":"2020","unstructured":"Chauhan Y, Duggal A. Different sorting algorithms comparison based upon the time complexity. Int J Res Anal Rev. 2020;3:114\u201321.","journal-title":"Int J Res Anal Rev"},{"key":"9724_CR111","unstructured":"Gill SK, Singh VP, Sharma P, Kumar D. A comparative study of various sorting algorithms. International Journal of Advanced Studies of Scientific Research, 2019; 4(1)."},{"issue":"1","key":"9724_CR112","first-page":"113","volume":"25","author":"S Buradagunta","year":"2020","unstructured":"Buradagunta S, Bodapati JD, Mundukur NB, Salma S. Performance comparison of sorting algorithms with random numbers as inputs. Ing\u00e9nierie Des Syst\u00e8mes D Inf. 2020;25(1):113\u20137.","journal-title":"Ing\u00e9nierie Des Syst\u00e8mes D Inf"},{"key":"9724_CR113","doi-asserted-by":"publisher","first-page":"1017","DOI":"10.1007\/s10766-017-0502-5","volume":"46","author":"DP Singh","year":"2018","unstructured":"Singh DP, Joshi I, Choudhary J. Survey of gpu based sorting algorithms. Int J Parallel Prog. 2018;46:1017\u201334.","journal-title":"Int J Parallel Prog"},{"issue":"1","key":"9724_CR114","doi-asserted-by":"publisher","first-page":"131","DOI":"10.4236\/jcc.2024.121009","volume":"12","author":"Y Alhabboub","year":"2024","unstructured":"Alhabboub Y, Almutairi F, Safhi M, Alqahtani Y, Almeedani A, Alguwaifli Y. Accelerating large-scale sorting through parallel algorithms. J Comput Commun. 2024;12(1):131\u20138.","journal-title":"J Comput Commun"},{"key":"9724_CR115","doi-asserted-by":"publisher","first-page":"1682","DOI":"10.1016\/j.procs.2023.01.146","volume":"218","author":"SK Gupta","year":"2023","unstructured":"Gupta SK, Singh DP, Choudhary J. New gpu sorting algorithm using sorted matrix. Proc Comput Sci. 2023;218:1682\u201391.","journal-title":"Proc Comput Sci"},{"key":"9724_CR116","doi-asserted-by":"crossref","unstructured":"Kobus, R, Nelgen, J, Henkys, V, Schmidt, B. Faster Segmented Sort on GPUs. European Conference on Parallel Processing, Springer, 2023;664\u2013678.","DOI":"10.1007\/978-3-031-39698-4_45"},{"key":"9724_CR117","unstructured":"Jalilvand A, Banitaba FS, Estiri SN, Aygun S, Najafi MH. Sorting it out in hardware: A state-of-the-art survey. ACM Transactions on Design Automation of Electronic Systems, ACM New York, NY, 2023;."}],"container-title":["Discover Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10791-025-09724-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10791-025-09724-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10791-025-09724-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T22:01:50Z","timestamp":1762207310000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10791-025-09724-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,3]]},"references-count":117,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2025,12]]}},"alternative-id":["9724"],"URL":"https:\/\/doi.org\/10.1007\/s10791-025-09724-w","relation":{},"ISSN":["2948-2992"],"issn-type":[{"value":"2948-2992","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11,3]]},"assertion":[{"value":"26 March 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 September 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 November 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for Publication"}},{"value":"The authors declare no Conflict of interest.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"250"}}