{"id":"https://openalex.org/W613216337","doi":"https://doi.org/10.5860/choice.48-5731","title":"Python Algorithms: mastering basic algorithms in the Python language","display_name":"Python Algorithms: mastering basic algorithms in the Python language","publication_year":2011,"publication_date":"2011-06-01","ids":{"openalex":"https://openalex.org/W613216337","doi":"https://doi.org/10.5860/choice.48-5731","mag":"613216337"},"language":"en","primary_location":{"id":"doi:10.5860/choice.48-5731","doi":"https://doi.org/10.5860/choice.48-5731","is_oa":false,"landing_page_url":"https://doi.org/10.5860/choice.48-5731","pdf_url":null,"source":{"id":"https://openalex.org/S2764375719","display_name":"Choice Reviews Online","issn_l":"0009-4978","issn":["0009-4978","1523-8253","1943-5975"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":"https://openalex.org/P4310316146","host_organization_name":"Association of College and Research Libraries","host_organization_lineage":["https://openalex.org/P4310316146","https://openalex.org/P4310315903"],"host_organization_lineage_names":["Association of College and Research Libraries","American Library Association"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Choice Reviews Online","raw_type":"journal-article"},"volume":null,"type":"book-review","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"48","issue":"10","first_page":"48","last_page":"5731"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10533","display_name":"Teaching and Learning Programming","score":0.6689000129699707,"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"}},"topics":[{"id":"https://openalex.org/T10533","display_name":"Teaching and Learning Programming","score":0.6689000129699707,"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/T11269","display_name":"Algorithms and Data Compression","score":0.1738000065088272,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.07590000331401825,"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/python","display_name":"Python","score":0.5220000147819519},{"id":"https://openalex.org/keywords/algorithms","display_name":"algorithms","score":0.968999981880188},{"id":"https://openalex.org/keywords/algorithm-design","display_name":"algorithm design","score":0.8360000252723694},{"id":"https://openalex.org/keywords/analysis-of-algorithms","display_name":"algorithm analysis","score":0.9890000224113464},{"id":"https://openalex.org/keywords/data-structures","display_name":"data structures","score":0.8669999837875366},{"id":"https://openalex.org/keywords/algorithmic-problem-solving","display_name":"algorithmic problem solving","score":0.8700000047683716},{"id":"https://openalex.org/keywords/program-correctness","display_name":"program correctness","score":0.4790000021457672},{"id":"https://openalex.org/keywords/benchmarking","display_name":"benchmarking","score":0.5559999942779541},{"id":"https://openalex.org/keywords/high-performance-computing","display_name":"high-performance computing","score":0.8320000171661377},{"id":"https://openalex.org/keywords/approximation-algorithms","display_name":"approximation algorithms","score":0.5490000247955322}],"concepts":[{"id":"https://openalex.org/C519991488","wikidata":"https://www.wikidata.org/wiki/Q28865","display_name":"Python (programming language)","level":2,"score":0.9454250335693359},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7365000247955322},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.6943572759628296},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6019642353057861},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.5633600950241089}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.5860/choice.48-5731","doi":"https://doi.org/10.5860/choice.48-5731","is_oa":false,"landing_page_url":"https://doi.org/10.5860/choice.48-5731","pdf_url":null,"source":{"id":"https://openalex.org/S2764375719","display_name":"Choice Reviews Online","issn_l":"0009-4978","issn":["0009-4978","1523-8253","1943-5975"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":"https://openalex.org/P4310316146","host_organization_name":"Association of College and Research Libraries","host_organization_lineage":["https://openalex.org/P4310316146","https://openalex.org/P4310315903"],"host_organization_lineage_names":["Association of College and Research Libraries","American Library Association"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Choice Reviews Online","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4231003421","https://openalex.org/W4400878027","https://openalex.org/W4409907133","https://openalex.org/W4409907007","https://openalex.org/W4409907211","https://openalex.org/W4409907156","https://openalex.org/W4409907188","https://openalex.org/W7223460555","https://openalex.org/W4409907114","https://openalex.org/W3186897776"],"abstract_inverted_index":{"Python":[0,4,79,91,139,159,219],"Algorithms":[1],"explains":[2],"the":[3,44,90,96,123,247],"approach":[5],"to":[6,101,113,126,132,177,223,249],"algorithm":[7],"analysis":[8],"and":[9,47,52,60,69,83,95,103,138,145,148,161,169,174,184,195],"design.":[10],"Written":[11],"by":[12],"Magnus":[13],"Lie":[14],"Hetland,":[15],"author":[16],"of":[17,33,43,50,128,203,234],"Beginning":[18],"Python,this":[19],"bookis":[20],"sharply":[21],"focused":[22],"on":[23,155],"classical":[24,167],"algorithms,":[25],"but":[26,55],"it":[27],"also":[28,245],"gives":[29],"a":[30,57,201,231],"solid":[31],"understanding":[32],"fundamental":[34],"algorithmic":[35,67,115,226],"problem-solving":[36],"techniques.":[37,196],"The":[38,63],"book":[39,64,212,215,248],"deals":[40],"with":[41,117],"some":[42],"most":[45],"important":[46],"challenging":[48],"areas":[49],"programming":[51,70],"computer":[53],"science,":[54],"in":[56,77,172,181,208],"highly":[58],"pedagogic":[59],"readable":[61],"manner.":[62],"covers":[65],"both":[66,141],"theory":[68,74],"practice,":[71],"demonstrating":[72],"how":[73,100],"is":[75,98,213,216],"reflected":[76],"real":[78],"programs.":[80],"Well-known":[81],"algorithms":[82,137,168,187],"data":[84,170],"structures":[85,171],"that":[86,122],"are":[87,93],"built":[88],"into":[89],"language":[92],"explained,":[94],"user":[97],"shown":[99],"implement":[102,178,185],"evaluate":[104],"others":[105],"himself.":[106],"What":[107],"youll":[108],"learn":[109,224],"Transform":[110],"new":[111,186,189],"problems":[112,116,124,129],"well-known":[114],"efficient":[118],"solutions,":[119],"or":[120,153,228,237],"show":[121],"belong":[125],"classes":[127],"thought":[130],"not":[131],"be":[133,175,250],"efficiently":[134,180],"solvable.":[135],"Analyze":[136],"programs":[140,160],"using":[142,191,200],"mathematical":[143],"tools":[144,204],"basic":[146],"experiments":[147],"benchmarks.":[149],"Prove":[150],"correctness,":[151],"optimality,":[152],"bounds":[154],"approximation":[156],"error":[157],"for":[158,188,205,218],"their":[162],"underlying":[163],"algorithms.":[164],"Understand":[165],"several":[166],"depth,":[173],"able":[176],"these":[179],"Python.":[182,209],"Design":[183],"problems,":[190],"time-tested":[192],"design":[193],"principles":[194],"Speed":[197],"up":[198],"implementations,":[199],"plethora":[202],"high-performance":[206],"computing":[207],"Who":[210],"this":[211],"forThe":[214],"intended":[217],"programmers":[220],"who":[221,229],"need":[222,230],"about":[225],"problem-solving,":[227],"refresher.":[232],"Students":[233],"Computer":[235],"Science,":[236],"similar":[238],"programming-related":[239],"topics,":[240],"such":[241],"as":[242],"bioinformatics,":[243],"may":[244],"find":[246],"quite":[251],"useful.":[252]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2015,"cited_by_count":3},{"year":2013,"cited_by_count":2}],"updated_date":"2026-11-10T11:39:43.021295","created_date":"2016-06-24T00:00:00"}