{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:26:10Z","timestamp":1759638370438,"version":"3.28.0"},"reference-count":21,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1109\/meco.2017.7977252","type":"proceedings-article","created":{"date-parts":[[2017,7,25]],"date-time":"2017-07-25T15:28:31Z","timestamp":1500996511000},"page":"1-6","source":"Crossref","is-referenced-by-count":2,"title":["A new modified sorting algorithm: A comparison with state of the art"],"prefix":"10.1109","author":[{"given":"Florim","family":"Idrizi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Avni","family":"Rustemi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fisnik","family":"Dalipi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/611892.611918"},{"key":"ref11","article-title":"A variant of Heapsort with almost optimal number of comparisons","volume":"24","author":"astrachan","year":"0","journal-title":"Elsevier Science Publishers B V (North-Holland)"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15328-0_2"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s002360050103"},{"key":"ref14","article-title":"Teaching sorting and searching algorithms through simulation-based learning objects in an introductory programming course","author":"tuparov","year":"2013","journal-title":"5th World Conference on Educational Sciences - WCES"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2016.07.292"},{"journal-title":"Solutions for Introduction to algorithms","year":"2002","author":"bille","key":"ref16"},{"journal-title":"Measuring execution time in c#","year":"2016","key":"ref17"},{"key":"ref18","article-title":"A Survey, Discussion and Comparison of Sorting Algorithms","author":"karunanithi","year":"2014","journal-title":"Department of Computing Science Umea University"},{"journal-title":"Counting sort","year":"2016","key":"ref19"},{"journal-title":"Why is quicksort better than other sorting algorithms in practice?","article-title":"cs.stackexchange.com\/questions\/3\/why-is-quicksort-better-than-other-sortingalgorithms-in-practice","year":"2017","key":"ref4"},{"key":"ref3","article-title":"Undirected connectivity in log-space","volume":"55","author":"omer","year":"2008","journal-title":"Journal of the ACM"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-81-322-2217-0_49"},{"key":"ref5","first-page":"17","article-title":"Fast SortingAlgorithms","author":"alt","year":"0","journal-title":"Algorithms unplugged"},{"key":"ref8","article-title":"Comparison of sorting algorithms (on the basis of average case)","volume":"3","author":"sareen","year":"2013","journal-title":"IJARCSSE"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1002\/cem.665"},{"key":"ref2","first-page":"72","article-title":"Counting Sort (a Stable Sort)","author":"jeff","year":"2008","journal-title":"How to Think about Algorithms"},{"key":"ref1","article-title":"Searching and sorting algorithms","volume":"cs117","author":"dalal","year":"2004","journal-title":"Lecture Notes Supplement"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-04657-0_22"},{"key":"ref20","first-page":"183","author":"gruber","year":"2007","journal-title":"Sorting the Slow Way An Analysis of Perversely Awful Randomized Sorting Algorithms"},{"key":"ref21","article-title":"Selection of Best Sorting Algorithm for a Particular Problem","author":"mishra","year":"2009","journal-title":"Computer Science and Engineering Department Thapar University Patiala-147004"}],"event":{"name":"2017 6th Mediterranean Conference on Embedded Computing (MECO)","start":{"date-parts":[[2017,6,11]]},"location":"Bar, Montenegro","end":{"date-parts":[[2017,6,15]]}},"container-title":["2017 6th Mediterranean Conference on Embedded Computing (MECO)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7970251\/7977112\/07977252.pdf?arnumber=7977252","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,8,16]],"date-time":"2017-08-16T12:08:49Z","timestamp":1502885329000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7977252\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/meco.2017.7977252","relation":{},"subject":[],"published":{"date-parts":[[2017,6]]}}}