{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,13]],"date-time":"2023-11-13T00:06:24Z","timestamp":1699833984866},"reference-count":16,"publisher":"Wiley","issue":"6","license":[{"start":{"date-parts":[[2006,10,27]],"date-time":"2006-10-27T00:00:00Z","timestamp":1161907200000},"content-version":"vor","delay-in-days":9279,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Softw Pract Exp"],"published-print":{"date-parts":[[1981,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>A sorting algorithm, called Stable Quicksort, is presented. the algorithm is comparable in speed with the Quicksort algorithm, but is stable. The experimental evidence presented support the theoretical evaluation of the performance of Stable Quicksort.<\/jats:p>","DOI":"10.1002\/spe.4380110604","type":"journal-article","created":{"date-parts":[[2006,11,17]],"date-time":"2006-11-17T12:10:32Z","timestamp":1163765432000},"page":"607-611","source":"Crossref","is-referenced-by-count":9,"title":["A stable quicksort"],"prefix":"10.1002","volume":"11","author":[{"given":"Dalia","family":"Motzkin","sequence":"first","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,27]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(74)90004-0"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1145\/366622.366644"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/5.1.10"},{"key":"e_1_2_1_5_2","first-page":"347","volume-title":"Fundamentals of Data Structures","author":"Horowitz E.","year":"1976"},{"key":"e_1_2_1_6_2","first-page":"194","volume-title":"Proc. 6th Annual Symp. of Theory of Computing (SIGACT 6)","author":"Horvath E. C.","year":"1974"},{"key":"e_1_2_1_7_2","volume-title":"The Art of Computer Programming 3","author":"Knuth D. E.","year":"1972"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1145\/360860.360870"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1145\/355694.355702"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(75)90019-5"},{"key":"e_1_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.1137\/0206025"},{"key":"e_1_2_1_12_2","unstructured":"RonaldRivest \u2018A fast stable minimum storage algorithm Rep. 43\u2019 Institute of Recherche d'lnformatique et d'Automatique Rocquencourt France Dec.1973."},{"key":"e_1_2_1_13_2","doi-asserted-by":"publisher","DOI":"10.1145\/365660.365678"},{"key":"e_1_2_1_14_2","unstructured":"R.Sedgewick Quicksort with Equal Keys Technical Report No. CS\u20108 Computer Science Program and Division of Applied Mathematics Brown University August1975."},{"key":"e_1_2_1_15_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF00289467"},{"key":"e_1_2_1_16_2","doi-asserted-by":"publisher","DOI":"10.1145\/362875.362901"},{"key":"e_1_2_1_17_2","doi-asserted-by":"publisher","DOI":"10.1145\/362790.362803"}],"container-title":["Software: Practice and Experience"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fspe.4380110604","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/spe.4380110604","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,12]],"date-time":"2023-11-12T13:35:11Z","timestamp":1699796111000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/spe.4380110604"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,6]]},"references-count":16,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1981,6]]}},"alternative-id":["10.1002\/spe.4380110604"],"URL":"https:\/\/doi.org\/10.1002\/spe.4380110604","archive":["Portico"],"relation":{},"ISSN":["0038-0644","1097-024X"],"issn-type":[{"value":"0038-0644","type":"print"},{"value":"1097-024X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1981,6]]}}}