{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T20:58:17Z","timestamp":1776977897582,"version":"3.51.4"},"reference-count":25,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,7,3]],"date-time":"2025-07-03T00:00:00Z","timestamp":1751500800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,7,3]],"date-time":"2025-07-03T00:00:00Z","timestamp":1751500800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,7,3]]},"DOI":"10.1109\/icecet63943.2025.11472533","type":"proceedings-article","created":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T19:42:35Z","timestamp":1775763755000},"page":"1-8","source":"Crossref","is-referenced-by-count":0,"title":["Hybrid Merge Sort Algorithms: A Review"],"prefix":"10.1109","author":[{"given":"Mohammed Alaa","family":"Ala\u2019anzy","sequence":"first","affiliation":[{"name":"SDU University,Dept. Computer Science,Almaty,Kazakhstan"}]},{"given":"Samrat","family":"Kakimgali","sequence":"additional","affiliation":[{"name":"SDU University,Dept. Computer Science,Almaty,Kazakhstan"}]},{"given":"Bakdaulet","family":"Yeskermes","sequence":"additional","affiliation":[{"name":"SDU University,Dept. Computer Science,Almaty,Kazakhstan"}]},{"given":"Perizat","family":"Yessenova","sequence":"additional","affiliation":[{"name":"SDU University,Dept. Computer Science,Almaty,Kazakhstan"}]},{"given":"Zhangyl","family":"Abilbek","sequence":"additional","affiliation":[{"name":"SDU University,Dept. Natural Sciences Pedagogy,Almaty,Kazakhstan"}]},{"given":"Inkar","family":"Shoganova","sequence":"additional","affiliation":[{"name":"SDU University,Dept. Information Systems,Almaty,Kazakhstan"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.3389\/feduc.2023.1195200"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1088\/1742-6596\/1018\/1\/012018"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISCMI63661.2024.10851593"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.3390\/sym9090176"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.13053\/cys-28-3-4870"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-63665-4_27"},{"key":"ref7","article-title":"Comparative complexity study of bubble sort and insertion sort using java programming language: A review","author":"Al-Amin","year":"2024","journal-title":"Journal of Science Innovation and Technology Research"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-024-01285-6"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.31326\/jisa.v7i1.1785"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.7546\/CRABS.2024.09.07"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.14569\/IJACSA.2022.0130110"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ICCIT60459.2023.10441404"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.5755\/j01.itc.48.3.23696"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s10586-018-2860-1"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-658-45198-1_2"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2944420"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2021.3070785"},{"key":"ref18","article-title":"Nearly-optimal mergesorts: Fast, practical sorting methods that optimally adapt to existing runs","author":"Munro","year":"2018"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/3664195"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/CSITSS60515.2023.10334130"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ICEECT61758.2024.10738877"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ICACCCT.2016.7831730"},{"issue":"3","key":"ref23","article-title":"Merge sort sequential and parallel programming: Comparative analysis","volume":"22","author":"Faisal","year":"2024","journal-title":"International Journal of Computer Science and Information Security (IJCSIS)"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/INTECH.2016.7845075"},{"key":"ref25","article-title":"On the worst-case complexity of timsort","author":"Auger","year":"2018"}],"event":{"name":"2025 5th International Conference on Electrical, Computer and Energy Technologies (ICECET)","location":"Paris, France","start":{"date-parts":[[2025,7,3]]},"end":{"date-parts":[[2025,7,6]]}},"container-title":["2025 5th International Conference on Electrical, Computer and Energy Technologies (ICECET)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11471878\/11471697\/11472533.pdf?arnumber=11472533","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T19:58:25Z","timestamp":1776974305000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11472533\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,3]]},"references-count":25,"URL":"https:\/\/doi.org\/10.1109\/icecet63943.2025.11472533","relation":{},"subject":[],"published":{"date-parts":[[2025,7,3]]}}}