{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T01:01:14Z","timestamp":1781053274236,"version":"3.54.1"},"reference-count":20,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Future Generation Computer Systems"],"published-print":{"date-parts":[[2026,11]]},"DOI":"10.1016\/j.future.2026.108609","type":"journal-article","created":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T23:29:51Z","timestamp":1779146991000},"page":"108609","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Adaptive hybrid sort: Dynamic strategy selection for optimal sorting across diverse data distributions"],"prefix":"10.1016","volume":"184","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-2161-5643","authenticated-orcid":false,"given":"Shrinivass","family":"Arunachalam Balasubramanian","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/j.future.2026.108609_bib0001","first-page":"112","article-title":"The Importance of Sorting Algorithms in the Digital Age","volume":"45","author":"Smith","year":"2023","journal-title":"J. Comput. Sci. Inf. Technol."},{"key":"10.1016\/j.future.2026.108609_bib0002","series-title":"Proc. Int. Conf. Emerging Trends IoT & Computing Technologies (ICETICT-2023)","first-page":"1","article-title":"Sorting Algorithms in Focus: A Critical Examination of Sorting Algorithm Performance","author":"Rizvi","year":"2024"},{"key":"10.1016\/j.future.2026.108609_bib0003","unstructured":"Y. Shi and Z. Li, \u201cLeyenda: An Adaptive, Hybrid Sorting Algorithm for Large Scale Data with Limited Memory,\u201d arXiv preprint arXiv:1909.08006, Sep. 2019. [Online]. Available: https:\/\/arxiv.org\/abs\/1909.08006."},{"key":"10.1016\/j.future.2026.108609_bib0004","doi-asserted-by":"crossref","unstructured":"V. Jug\u00e9, \u201cAdaptive Shivers Sort: An Alternative Sorting Algorithm,\u201d pp. 1\u201339, Sep. 2020.","DOI":"10.1137\/1.9781611975994.101"},{"key":"10.1016\/j.future.2026.108609_bib0005","article-title":"Hybridization and Optimization Modeling, Analysis, and Comparative Study of Sorting Algorithms: Adaptive Techniques, Parallelization, for Mergesort, Heapsort, Quicksort, Insertion Sort, Selection Sort, and Bubble Sort","author":"Mohammadagha","year":"2025","journal-title":"Engineering Archive"},{"key":"10.1016\/j.future.2026.108609_bib0006","first-page":"5","article-title":"Hybrid Machine Learning Framework for Test Case Generation","volume":"9","author":"Balasubramanian","year":"2021","journal-title":"Intelligence"},{"key":"10.1016\/j.future.2026.108609_bib0007","unstructured":"E. Al-Shargabi and G. Morse, \u201cExploration of Machine Learning Techniques for Adaptive Selection of Sorting Algorithms Based on Data Characteristics,\u201d 2023."},{"issue":"4","key":"10.1016\/j.future.2026.108609_bib0008","doi-asserted-by":"crossref","first-page":"3557","DOI":"10.38124\/ijisrt\/25apr1899","article-title":"Machine Learning for Predictive Analytics: Trends and Future Directions","volume":"10","author":"Majumder","year":"2025","journal-title":"Int. J. Innov. Sci. Res. Technol."},{"issue":"2","key":"10.1016\/j.future.2026.108609_bib0009","first-page":"16","article-title":"The Role of Machine Learning in Big Data Analytics: Tools, Techniques, and Applications","volume":"5","author":"Prajapati","year":"2025","journal-title":"ESP J. Eng. Technol. Adv."},{"issue":"63","key":"10.1016\/j.future.2026.108609_bib0010","first-page":"1","article-title":"Nearly-optimal mergesorts: Fast, practical sorting methods that optimally adapt to existing runs","volume":"112","author":"Munro","year":"2018","journal-title":"Leibniz Int. Proc. Informatics, LIPIcs"},{"key":"10.1016\/j.future.2026.108609_bib0011","article-title":"SlowSort: Memory-efficient integer deduplication sorting for large-scale datasets","author":"Wang","year":"2025","journal-title":"Software: Practice and Experience"},{"key":"10.1016\/j.future.2026.108609_bib0012","doi-asserted-by":"crossref","unstructured":"N. Seidu and E. Yellakuor, \u201cOptiFlexSort\u202f: A Hybrid Sorting Algorithm for Efficient Large-Scale Data Processing,\u201d no. February, 2025, doi: 10.9734\/jamcs\/2025\/v40i21970.","DOI":"10.9734\/jamcs\/2025\/v40i21970"},{"key":"10.1016\/j.future.2026.108609_bib0013","doi-asserted-by":"crossref","first-page":"579","DOI":"10.3390\/electronics14030579","article-title":"A Scalable Sorting Network Based on Hybrid Algorithms for Accelerating Data Sorting","volume":"14","author":"Li","year":"2025","journal-title":"Electronics"},{"issue":"2","key":"10.1016\/j.future.2026.108609_bib0014","first-page":"1","article-title":"A Novel Hybrid Multi-Objective Optimization Algorithm and Its Application to Designs of Electromagnetic Devices","volume":"61","author":"Li","year":"2025","journal-title":"IEEE Trans. Magn."},{"key":"10.1016\/j.future.2026.108609_bib0015","series-title":"Algorithms and Architectures for Parallel Processing (ICA3PP 2024)","first-page":"39","article-title":"A Hybrid Vectorized Merge Sort on ARM NEON","volume":"15256","author":"Zhou","year":"2025"},{"key":"10.1016\/j.future.2026.108609_bib0016","series-title":"2024 19th Iranian Conference on Intelligent Systems (ICIS)","first-page":"62","article-title":"Intelligent Estimation of Control Parameters of a Flexible Robot by Using Non-Dominated Sorting Genetic Algorithm (NSGA-II)","author":"Pezhman","year":"2024"},{"key":"10.1016\/j.future.2026.108609_bib0017","series-title":"2023 7th International Conference on Computation System and Information Technology for Sustainable Solutions (CSITSS)","first-page":"1","article-title":"BQM Hybrid Sorting Algorithm","author":"Shaik","year":"2023"},{"issue":"01","key":"10.1016\/j.future.2026.108609_bib0018","first-page":"1339","article-title":"Developing More Efficient Algorithms for Sorting and Searching Large Data Sets","author":"Aditya","year":"2023","journal-title":"Int. Res. J. Mod. Eng. Technol. Sci."},{"key":"10.1016\/j.future.2026.108609_bib0019","series-title":"2023 11th International Conference on Intelligent Systems and Embedded Design (ISED)","first-page":"1","article-title":"Performance Analysis of Various Sorting Algorithms: Comparison and Optimization","author":"Goel","year":"2023"},{"key":"10.1016\/j.future.2026.108609_bib0020","series-title":"2022 25th International Conference on Computer and Information Technology (ICCIT)","first-page":"412","article-title":"Enhancement of Bubble and Insertion Sort Algorithm Using Block Partitioning","author":"Paul","year":"2022"}],"container-title":["Future Generation Computer Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167739X26002438?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167739X26002438?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T00:41:25Z","timestamp":1781052085000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167739X26002438"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,11]]},"references-count":20,"alternative-id":["S0167739X26002438"],"URL":"https:\/\/doi.org\/10.1016\/j.future.2026.108609","relation":{},"ISSN":["0167-739X"],"issn-type":[{"value":"0167-739X","type":"print"}],"subject":[],"published":{"date-parts":[[2026,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Adaptive hybrid sort: Dynamic strategy selection for optimal sorting across diverse data distributions","name":"articletitle","label":"Article Title"},{"value":"Future Generation Computer Systems","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.future.2026.108609","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"108609"}}