{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:37:14Z","timestamp":1750307834501,"version":"3.41.0"},"reference-count":5,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2008,6,1]],"date-time":"2008-06-01T00:00:00Z","timestamp":1212278400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGCSE Bull."],"published-print":{"date-parts":[[2008,6]]},"abstract":"<jats:p>This uses a massively wrong-headed algorithm for sorting to exemplify the use of the backtracking strategy and the branch-and-bound strategy. In addition, brief notes are included on parallel processing approaches: Java theads on multi-core computers and distributed processing through such message passing systems as PVM and MPI.<\/jats:p>","DOI":"10.1145\/1383602.1383634","type":"journal-article","created":{"date-parts":[[2008,6,24]],"date-time":"2008-06-24T12:48:51Z","timestamp":1214311731000},"page":"52-55","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Perverse and foolish oft I strayed"],"prefix":"10.1145","volume":"40","author":[{"given":"Timothy J.","family":"Rolfe","sequence":"first","affiliation":[{"name":"Eastern Washington University, Cheney, Washington"}]}],"member":"320","published-online":{"date-parts":[[2008,6]]},"reference":[{"key":"e_1_2_1_1_1","first-page":"197","volume-title":"London","author":"Schirmer G.","year":"1991"},{"issue":"1","key":"e_1_2_1_2_1","first-page":"113","volume":"25","author":"Rolfe J","year":"2000","journal-title":"Dr. Dobb's Journal"},{"key":"e_1_2_1_3_1","unstructured":"http:\/\/stdout.org\/~adam\/psort\/---as accessed 2007 December 28.  http:\/\/stdout.org\/~adam\/psort\/---as accessed 2007 December 28."},{"key":"e_1_2_1_4_1","unstructured":"The entire backtracking chapter of Sartaj Sahni's Data Structures Algorithms and Applications in Java (2nd ed. 2005) is available online: http:\/\/www.cise.ufl.edu\/~sahni\/dsaaj\/chapters.htm  The entire backtracking chapter of Sartaj Sahni's Data Structures Algorithms and Applications in Java (2nd ed. 2005) is available online: http:\/\/www.cise.ufl.edu\/~sahni\/dsaaj\/chapters.htm"},{"key":"e_1_2_1_5_1","unstructured":"Similarly the entire branch and bound chapter from the same standard text is available through the above URL.  Similarly the entire branch and bound chapter from the same standard text is available through the above URL."}],"container-title":["ACM SIGCSE Bulletin"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1383602.1383634","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1383602.1383634","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:58:00Z","timestamp":1750255080000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1383602.1383634"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,6]]},"references-count":5,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2008,6]]}},"alternative-id":["10.1145\/1383602.1383634"],"URL":"https:\/\/doi.org\/10.1145\/1383602.1383634","relation":{},"ISSN":["0097-8418"],"issn-type":[{"type":"print","value":"0097-8418"}],"subject":[],"published":{"date-parts":[[2008,6]]},"assertion":[{"value":"2008-06-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}