{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,25]],"date-time":"2023-10-25T13:25:21Z","timestamp":1698240321478},"reference-count":10,"publisher":"Wiley","issue":"6","license":[{"start":{"date-parts":[[2006,10,30]],"date-time":"2006-10-30T00:00:00Z","timestamp":1162166400000},"content-version":"vor","delay-in-days":8186,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Softw Pract Exp"],"published-print":{"date-parts":[[1984,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The widely known Quicksort algorithm does not attempt to actively take advantage of partial order in sorting data. A simple change can be made to the Quicksort strategy to give a bestcase performance of <jats:italic>n<\/jats:italic>, for ordered data, with a smooth transition to <jats:italic>O(n log n)<\/jats:italic> for random data. This algorithm (Transort) matches the performance of Sedgewick's claimed best implementation of Quicksort for random data.<\/jats:p>","DOI":"10.1002\/spe.4380140603","type":"journal-article","created":{"date-parts":[[2006,11,18]],"date-time":"2006-11-18T04:01:30Z","timestamp":1163822490000},"page":"509-518","source":"Crossref","is-referenced-by-count":16,"title":["Exploiting partial order with Quicksort"],"prefix":"10.1002","volume":"14","author":[{"given":"R. Geoff","family":"Dromey","sequence":"first","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,30]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/5.1.10"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1145\/362736.362753"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1145\/365660.365678"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1145\/362875.362901"},{"key":"e_1_2_1_6_2","unstructured":"R.Sedgewick \u2018Quicksort\u2019 Ph.D Thesis Standford University 1975. (Report Number STAN\u2010CS\u201075\u2013492.)"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1145\/359619.359631"},{"key":"e_1_2_1_8_2","volume-title":"The Art of Computer Programming, Vol., 3, Sorting and Searching","author":"Knuth D. E.","year":"1972"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1145\/359024.359026"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6423(82)90016-8"},{"key":"e_1_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380111211"}],"container-title":["Software: Practice and Experience"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fspe.4380140603","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/spe.4380140603","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,19]],"date-time":"2023-10-19T20:38:41Z","timestamp":1697747921000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/spe.4380140603"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,6]]},"references-count":10,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1984,6]]}},"alternative-id":["10.1002\/spe.4380140603"],"URL":"https:\/\/doi.org\/10.1002\/spe.4380140603","archive":["Portico"],"relation":{},"ISSN":["0038-0644","1097-024X"],"issn-type":[{"value":"0038-0644","type":"print"},{"value":"1097-024X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1984,6]]}}}