{"id":"https://openalex.org/W2049711551","doi":"https://doi.org/10.1145/1953163.1953203","title":"Sorting algorithms as special cases of a priority queue sort","display_name":"Sorting algorithms as special cases of a priority queue sort","publication_year":2011,"publication_date":"2011-03-09","ids":{"openalex":"https://openalex.org/W2049711551","doi":"https://doi.org/10.1145/1953163.1953203","mag":"2049711551"},"language":"en","primary_location":{"id":"doi:10.1145/1953163.1953203","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1953163.1953203","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 42nd ACM technical symposium on Computer science education","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5051736855","display_name":"Tim Bell","orcid":"https://orcid.org/0000-0002-0148-0857"},"institutions":[{"id":"https://openalex.org/I185492890","display_name":"University of Canterbury","ror":"https://ror.org/03y7q9t39","country_code":"NZ","type":"education","lineage":["https://openalex.org/I185492890"]}],"countries":["NZ"],"is_corresponding":true,"raw_author_name":"Tim Bell","raw_affiliation_strings":["University of Canterbury, Christchurch, New Zealand","University of Canterbury, Christchurch , New Zealand"],"affiliations":[{"raw_affiliation_string":"University of Canterbury, Christchurch, New Zealand","institution_ids":["https://openalex.org/I185492890"]},{"raw_affiliation_string":"University of Canterbury, Christchurch , New Zealand","institution_ids":["https://openalex.org/I185492890"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5034298677","display_name":"Bengt Aspvall","orcid":null},"institutions":[{"id":"https://openalex.org/I52719799","display_name":"Blekinge Institute of Technology","ror":"https://ror.org/0093a8w51","country_code":"SE","type":"education","lineage":["https://openalex.org/I52719799"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Bengt Aspvall","raw_affiliation_strings":["Blekinge Institute of Technology, Karlskrona, Sweden"],"affiliations":[{"raw_affiliation_string":"Blekinge Institute of Technology, Karlskrona, Sweden","institution_ids":["https://openalex.org/I52719799"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5051736855"],"corresponding_institution_ids":["https://openalex.org/I185492890"],"apc_list":null,"apc_paid":null,"fwci":0.8552,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.79363752,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"123","last_page":"128"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10317","display_name":"Advanced Database Systems and Queries","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9954000115394592,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7863106727600098},{"id":"https://openalex.org/keywords/sorting-algorithm","display_name":"Sorting algorithm","score":0.7544931769371033},{"id":"https://openalex.org/keywords/sort","display_name":"sort","score":0.6957713961601257},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.6443313360214233},{"id":"https://openalex.org/keywords/priority-queue","display_name":"Priority queue","score":0.5975106358528137},{"id":"https://openalex.org/keywords/queue","display_name":"Queue","score":0.5149277448654175},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.46040523052215576},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3657316565513611},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.16547730565071106},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.07517680525779724}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7863106727600098},{"id":"https://openalex.org/C108094655","wikidata":"https://www.wikidata.org/wiki/Q181593","display_name":"Sorting algorithm","level":3,"score":0.7544931769371033},{"id":"https://openalex.org/C88548561","wikidata":"https://www.wikidata.org/wiki/Q347599","display_name":"sort","level":2,"score":0.6957713961601257},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.6443313360214233},{"id":"https://openalex.org/C26951474","wikidata":"https://www.wikidata.org/wiki/Q629283","display_name":"Priority queue","level":3,"score":0.5975106358528137},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.5149277448654175},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46040523052215576},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3657316565513611},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.16547730565071106},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.07517680525779724}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1953163.1953203","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1953163.1953203","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 42nd ACM technical symposium on Computer science education","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/4","score":0.8799999952316284,"display_name":"Quality Education"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W100509257","https://openalex.org/W1507039213","https://openalex.org/W1546863136","https://openalex.org/W1562115776","https://openalex.org/W1576138761","https://openalex.org/W1963503748","https://openalex.org/W2051283794","https://openalex.org/W2057245959","https://openalex.org/W2115190288","https://openalex.org/W2123210367","https://openalex.org/W2150580621","https://openalex.org/W2439771716","https://openalex.org/W2624301084","https://openalex.org/W2752853835","https://openalex.org/W2752908210","https://openalex.org/W2753176400","https://openalex.org/W2924280552","https://openalex.org/W3019365222","https://openalex.org/W3145128584","https://openalex.org/W3198470706","https://openalex.org/W4240200084","https://openalex.org/W4252707254","https://openalex.org/W6632713753","https://openalex.org/W6633596644"],"related_works":["https://openalex.org/W2809748609","https://openalex.org/W2095055219","https://openalex.org/W2908348257","https://openalex.org/W3033694952","https://openalex.org/W2994182992","https://openalex.org/W2372558933","https://openalex.org/W2116295091","https://openalex.org/W2362374543","https://openalex.org/W2085265870","https://openalex.org/W2348196682"],"abstract_inverted_index":{"This":[0,18,140],"paper":[1,74],"offers":[2],"an":[3,61],"exercise":[4],"for":[5],"revisiting":[6],"the":[7,26,41,81,104,111,120],"main":[8,112],"sorting":[9,87,113],"algorithms":[10,114,130],"after":[11],"they":[12],"have":[13,53],"been":[14],"taught":[15],"to":[16,40,69,83,106,125,145,154],"students.":[17],"is":[19],"done":[20],"in":[21,64,103,117],"a":[22,77,94,97,127],"way":[23],"that":[24,115,150],"emphasizes":[25],"relationships":[27,56,109,137],"between":[28,57,110,138],"them,":[29],"and":[30,35,131,134,147],"shows":[31],"how":[32],"considering":[33],"abstraction":[34],"extreme":[36],"cases":[37],"can":[38,142],"lead":[39,144],"generation":[42],"of":[43,48,129,158],"new":[44],"algorithms.":[45,88,160],"A":[46],"number":[47,128],"authors":[49],"(including":[50],"textbook":[51],"authors)":[52],"noted":[54],"particular":[55],"algorithms,":[58],"such":[59],"as":[60,96],"uneven":[62],"split":[63],"merge":[65],"sort":[66],"being":[67],"equivalent":[68],"insertion":[70],"sort.":[71],"In":[72,119],"this":[73,91],"we":[75],"use":[76],"flexible":[78],"priority":[79,98],"queue,":[80,99],"d-heap,":[82],"derive":[84],"three":[85],"common":[86],"We":[89],"combine":[90],"with":[92],"using":[93],"BST":[95],"plus":[100],"prior":[101],"observations":[102],"literature,":[105],"show":[107],"strong":[108],"appear":[116],"textbooks.":[118],"process":[121],"students":[122],"are":[123],"able":[124],"revisit":[126],"data":[132],"structures":[133],"explore":[135],"elegant":[136],"them.":[139],"approach":[141],"also":[143],"exercises":[146],"exam":[148],"questions":[149],"go":[151],"beyond":[152],"desk-checking":[153],"evaluate":[155],"students'":[156],"understanding":[157],"these":[159]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}