{"id":"https://openalex.org/W1493296159","doi":"https://doi.org/10.1017/cbo9780511804793.015","title":"Advanced Sorting Algorithms","display_name":"Advanced Sorting Algorithms","publication_year":2007,"publication_date":"2007-03-26","ids":{"openalex":"https://openalex.org/W1493296159","doi":"https://doi.org/10.1017/cbo9780511804793.015","mag":"1493296159"},"language":"en","primary_location":{"id":"doi:10.1017/cbo9780511804793.015","doi":"https://doi.org/10.1017/cbo9780511804793.015","is_oa":false,"landing_page_url":"https://doi.org/10.1017/cbo9780511804793.015","pdf_url":null,"source":{"id":"https://openalex.org/S4306462995","display_name":"Cambridge University Press eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Data Structures and Algorithms Using C#","raw_type":"book-chapter"},"volume":{"id":"https://openalex.org/W647976879","display_name":"Data Structures and Algorithms Using C#"},"type":"book-chapter","is_traditional":true,"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/A5019518793","display_name":"Michael McMillan","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I2799974357","display_name":"Pulaski Technical College","ror":"https://ror.org/010dgsx92","country_code":"US","type":"education","lineage":["https://openalex.org/I2799974357"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Michael McMillan","raw_affiliation_strings":["Pulaski Technical College, Arkansas"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Pulaski Technical College, Arkansas","institution_ids":["https://openalex.org/I2799974357"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5019518793"],"corresponding_institution_ids":["https://openalex.org/I2799974357"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"249","last_page":"262"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9121000170707703,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.9121000170707703,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10533","display_name":"Teaching and Learning Programming","score":0.06520000100135803,"subfield":{"id":"https://openalex.org/subfields/1706","display_name":"Computer Science Applications"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.007799999788403511,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/sorting-algorithms","display_name":"sorting algorithms","score":0.9779999852180481},{"id":"https://openalex.org/keywords/quicksort","display_name":"quicksort","score":0.6990000009536743},{"id":"https://openalex.org/keywords/shell-sort","display_name":"shell sort","score":0.9629999995231628},{"id":"https://openalex.org/keywords/merge-sort","display_name":"merge sort","score":0.9980000257492065},{"id":"https://openalex.org/keywords/heapsort","display_name":"heapsort","score":1.0},{"id":"https://openalex.org/keywords/insertion-sort","display_name":"insertion sort","score":0.9570000171661377},{"id":"https://openalex.org/keywords/gap-sequences","display_name":"gap sequences","score":0.546999990940094},{"id":"https://openalex.org/keywords/algorithmic-efficiency","display_name":"algorithm efficiency","score":0.8500000238418579},{"id":"https://openalex.org/keywords/algorithm-comparison","display_name":"algorithm comparison","score":0.4020000100135803}],"concepts":[{"id":"https://openalex.org/C2778937211","wikidata":"https://www.wikidata.org/wiki/Q486598","display_name":"Quicksort","level":4,"score":0.9534229040145874},{"id":"https://openalex.org/C35555965","wikidata":"https://www.wikidata.org/wiki/Q189057","display_name":"Merge sort","level":4,"score":0.907747745513916},{"id":"https://openalex.org/C108094655","wikidata":"https://www.wikidata.org/wiki/Q181593","display_name":"Sorting algorithm","level":3,"score":0.8747807145118713},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6978908777236938},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.6775352954864502},{"id":"https://openalex.org/C140086265","wikidata":"https://www.wikidata.org/wiki/Q11341754","display_name":"Merge algorithm","level":4,"score":0.5971998572349548},{"id":"https://openalex.org/C88548561","wikidata":"https://www.wikidata.org/wiki/Q347599","display_name":"sort","level":2,"score":0.5955315828323364},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5188949704170227},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.39324212074279785},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.06070980429649353}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1017/cbo9780511804793.015","doi":"https://doi.org/10.1017/cbo9780511804793.015","is_oa":false,"landing_page_url":"https://doi.org/10.1017/cbo9780511804793.015","pdf_url":null,"source":{"id":"https://openalex.org/S4306462995","display_name":"Cambridge University Press eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Data Structures and Algorithms Using C#","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2227574597","https://openalex.org/W2144560332","https://openalex.org/W7096535296","https://openalex.org/W2948755375","https://openalex.org/W2383314597","https://openalex.org/W2351076281","https://openalex.org/W4244836736","https://openalex.org/W4299607201","https://openalex.org/W1983633301","https://openalex.org/W171591771"],"abstract_inverted_index":{"In":[0],"this":[1,120],"chapter,":[2],"we":[3],"examine":[4,52],"algorithms":[5,15,21,50],"for":[6],"sorting":[7,49,65],"data":[8,147],"that":[9,123,127,164],"are":[10,22,53,128,165],"more":[11,24],"complex":[12],"than":[13,131],"the":[14,30,38,54,56,59,78,83,88,113,138,142,146,149,157,159],"examined":[16],"in":[17,44,77,119,137],"Chapter":[18],"4.":[19],"These":[20],"also":[23],"efficient,":[25],"and":[26,58,76],"one":[27],"of":[28,72,90,112],"them,":[29],"QuickSort":[31],"algorithm,":[32],"is":[33,74,99,108,122,135,161],"generally":[34],"considered":[35],"to":[36,42,86],"be":[37,185],"most":[39,45],"efficient":[40],"sort":[41],"use":[43,82],"situations.":[46],"The":[47,96,116,176],"other":[48],"we'll":[51,67],"ShellSort,":[55],"MergeSort,":[57],"HeapSort.":[60],"To":[61],"compare":[62],"these":[63,91],"advanced":[64],"algorithms,":[66],"first":[68],"discuss":[69],"how":[70],"each":[71,152],"them":[73],"implemented,":[75],"exercises":[79],"you":[80],"will":[81],"Timing":[84],"class":[85],"determine":[87],"efficiency":[89],"algorithms.":[92],"THE":[93],"SHELLSORT":[94],"ALGORITHM":[95],"ShellSort":[97,167],"algorithm":[98,107,121,143,160],"named":[100],"after":[101],"its":[102],"inventor":[103],"Donald":[104],"Shell.":[105],"This":[106],"fundamentally":[109],"an":[110,173],"improvement":[111],"insertion":[114,139],"sort.":[115,140],"key":[117],"concept":[118],"it":[124],"compares":[125],"items":[126,163],"distant":[129,169],"rather":[130],"adjacent":[132],"items,":[133],"as":[134],"done":[136],"As":[141],"loops":[144],"through":[145],"set,":[148],"distance":[150],"between":[151],"item":[153],"decreases":[154],"until":[155],"at":[156],"end":[158],"comparing":[162],"adjacent.":[166],"sorts":[168],"elements":[170],"by":[171,187],"using":[172],"increment":[174],"sequence.":[175],"sequence":[177],"must":[178],"start":[179],"with":[180],"1,":[181],"but":[182],"can":[183],"then":[184],"incremented":[186],"any":[188],"amount.":[189]},"counts_by_year":[],"updated_date":"2026-10-10T09:11:00.788812","created_date":"2016-06-24T00:00:00"}