{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T10:53:38Z","timestamp":1649069618697},"reference-count":9,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1994,5,1]],"date-time":"1994-05-01T00:00:00Z","timestamp":767750400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computer Languages"],"published-print":{"date-parts":[[1994,5]]},"DOI":"10.1016\/0096-0551(94)90019-1","type":"journal-article","created":{"date-parts":[[2003,8,7]],"date-time":"2003-08-07T23:04:53Z","timestamp":1060297493000},"page":"127-134","source":"Crossref","is-referenced-by-count":2,"title":["An empirical study of the run-time behavior of quicksort, Shellsort and mergesort for medium to large size data"],"prefix":"10.1016","volume":"20","author":[{"given":"S.","family":"Mansoor Sarwar","sequence":"first","affiliation":[]},{"given":"Mansour H.A.","family":"Jaragh","sequence":"additional","affiliation":[]},{"given":"Mike","family":"Wind","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0096-0551(94)90019-1_BIB1","author":"Knuth","year":"1973"},{"key":"10.1016\/0096-0551(94)90019-1_BIB2","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1093\/comjnl\/34.1.88","article-title":"Empirical study of the expected running time of Shellsort","volume":"34","author":"Weiss","year":"1991","journal-title":"Comput. J."},{"key":"10.1016\/0096-0551(94)90019-1_BIB3","series-title":"Algorithms","author":"Sedgewick","year":"1988"},{"key":"10.1016\/0096-0551(94)90019-1_BIB4","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0020-0190(90)90134-J","article-title":"More on Shellsort increment sequences","volume":"34","author":"Weiss","year":"1990","journal-title":"Inform. Processing Lett."},{"key":"10.1016\/0096-0551(94)90019-1_BIB5","series-title":"Data Structures and Algorithm Analysis in C","author":"Weiss","year":"1993"},{"key":"10.1016\/0096-0551(94)90019-1_BIB6","series-title":"Data Structures and Algorithms","author":"Aho","year":"1983"},{"key":"10.1016\/0096-0551(94)90019-1_BIB7","series-title":"Algorithms and Data Structures","author":"Nievergelt","year":"1993"},{"key":"10.1016\/0096-0551(94)90019-1_BIB8","doi-asserted-by":"crossref","first-page":"713","DOI":"10.1145\/362854.362881","article-title":"A high-speed sorting procedure","volume":"14","author":"Shell","year":"1959","journal-title":"CACM"},{"key":"10.1016\/0096-0551(94)90019-1_BIB9","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1093\/comjnl\/5.1.10","article-title":"Quicksort","volume":"5","author":"Hoare","year":"1962","journal-title":"Comput. J."}],"container-title":["Computer Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0096055194900191?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0096055194900191?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T07:26:39Z","timestamp":1552634799000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0096055194900191"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,5]]},"references-count":9,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1994,5]]}},"alternative-id":["0096055194900191"],"URL":"https:\/\/doi.org\/10.1016\/0096-0551(94)90019-1","relation":{},"ISSN":["0096-0551"],"issn-type":[{"value":"0096-0551","type":"print"}],"subject":[],"published":{"date-parts":[[1994,5]]}}}