Algorithmic thinking: a problem-based introduction
"An introduction to solving problems with algorithms and data structures, using competitive programming examples. Topics covered include recursion, dynamic programming, graphs, greedy algorithms, heaps, hash tables, segment trees, and other data structures for efficiently handling data"-Pr...
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
San Francisco
No Starch Press
[2021]
|
Schlagworte: | |
Zusammenfassung: | "An introduction to solving problems with algorithms and data structures, using competitive programming examples. Topics covered include recursion, dynamic programming, graphs, greedy algorithms, heaps, hash tables, segment trees, and other data structures for efficiently handling data"-Provided by publisher"-- |
Beschreibung: | 2010 |
Beschreibung: | xxix, 373 pages illustrations 24 cm |
ISBN: | 9781718500808 1718500807 |
Internformat
MARC
LEADER | 00000nam a22000008c 4500 | ||
---|---|---|---|
001 | BV047234225 | ||
003 | DE-604 | ||
005 | 20240206 | ||
007 | t | ||
008 | 210412s2021 a||| b||| 00||| eng d | ||
020 | |a 9781718500808 |9 978-1-7185-0080-8 | ||
020 | |a 1718500807 |9 1-7185-0080-7 | ||
035 | |a (OCoLC)1249661549 | ||
035 | |a (DE-599)BVBBV047234225 | ||
040 | |a DE-604 |b ger |e rda | ||
041 | 0 | |a eng | |
049 | |a DE-573 |a DE-898 |a DE-1043 | ||
084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
084 | |a ST 230 |0 (DE-625)143617: |2 rvk | ||
084 | |a ST 240 |0 (DE-625)143625: |2 rvk | ||
100 | 1 | |a Zingaro, Daniel |e Verfasser |4 aut | |
245 | 1 | 0 | |a Algorithmic thinking |b a problem-based introduction |c by Daniel Zingaro |
264 | 1 | |a San Francisco |b No Starch Press |c [2021] | |
300 | |a xxix, 373 pages |b illustrations |c 24 cm | ||
336 | |b txt |2 rdacontent | ||
336 | |b sti |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
500 | |a 2010 | ||
505 | 8 | |a Hash tables -- Trees and recursion -- Memoization and dynamic programming -- Graphs and breadth-first search -- Shortest paths in weighted graphs -- Binary search -- Heaps and segment trees -- Union-find | |
520 | 3 | |a "An introduction to solving problems with algorithms and data structures, using competitive programming examples. Topics covered include recursion, dynamic programming, graphs, greedy algorithms, heaps, hash tables, segment trees, and other data structures for efficiently handling data"-Provided by publisher"-- | |
650 | 0 | 7 | |a Programmierung |0 (DE-588)4076370-5 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
653 | 0 | |a Computer algorithms / Problems, exercises, etc | |
653 | 0 | |a Computer programming / Problems, exercises, etc | |
653 | 0 | |a MATHEMATICS / General | |
653 | 0 | |a Computer algorithms | |
653 | 0 | |a Computer programming | |
653 | 6 | |a Problems and exercises | |
653 | 6 | |a Problems and exercises | |
653 | 6 | |a Handbooks and manuals | |
689 | 0 | 0 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
689 | 0 | 1 | |a Programmierung |0 (DE-588)4076370-5 |D s |
689 | 0 | |5 DE-604 | |
776 | 0 | 8 | |i Online version |a Zingaro, Daniel |t Algorithmic thinking |d San Francisco : No Starch Press, 2020 |z 9781718500815 |
999 | |a oai:aleph.bib-bvb.de:BVB01-032638631 |
Datensatz im Suchindex
_version_ | 1804182367348195328 |
---|---|
adam_txt | |
any_adam_object | |
any_adam_object_boolean | |
author | Zingaro, Daniel |
author_facet | Zingaro, Daniel |
author_role | aut |
author_sort | Zingaro, Daniel |
author_variant | d z dz |
building | Verbundindex |
bvnumber | BV047234225 |
classification_rvk | ST 134 ST 230 ST 240 |
contents | Hash tables -- Trees and recursion -- Memoization and dynamic programming -- Graphs and breadth-first search -- Shortest paths in weighted graphs -- Binary search -- Heaps and segment trees -- Union-find |
ctrlnum | (OCoLC)1249661549 (DE-599)BVBBV047234225 |
discipline | Informatik |
discipline_str_mv | Informatik |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02277nam a22005178c 4500</leader><controlfield tag="001">BV047234225</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20240206 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">210412s2021 a||| b||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781718500808</subfield><subfield code="9">978-1-7185-0080-8</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1718500807</subfield><subfield code="9">1-7185-0080-7</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1249661549</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV047234225</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-573</subfield><subfield code="a">DE-898</subfield><subfield code="a">DE-1043</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 134</subfield><subfield code="0">(DE-625)143590:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 230</subfield><subfield code="0">(DE-625)143617:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 240</subfield><subfield code="0">(DE-625)143625:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Zingaro, Daniel</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Algorithmic thinking</subfield><subfield code="b">a problem-based introduction</subfield><subfield code="c">by Daniel Zingaro</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">San Francisco</subfield><subfield code="b">No Starch Press</subfield><subfield code="c">[2021]</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">xxix, 373 pages</subfield><subfield code="b">illustrations</subfield><subfield code="c">24 cm</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">sti</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">2010</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">Hash tables -- Trees and recursion -- Memoization and dynamic programming -- Graphs and breadth-first search -- Shortest paths in weighted graphs -- Binary search -- Heaps and segment trees -- Union-find</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">"An introduction to solving problems with algorithms and data structures, using competitive programming examples. Topics covered include recursion, dynamic programming, graphs, greedy algorithms, heaps, hash tables, segment trees, and other data structures for efficiently handling data"-Provided by publisher"--</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Programmierung</subfield><subfield code="0">(DE-588)4076370-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Computer algorithms / Problems, exercises, etc</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Computer programming / Problems, exercises, etc</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">MATHEMATICS / General</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Computer algorithms</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Computer programming</subfield></datafield><datafield tag="653" ind1=" " ind2="6"><subfield code="a">Problems and exercises</subfield></datafield><datafield tag="653" ind1=" " ind2="6"><subfield code="a">Problems and exercises</subfield></datafield><datafield tag="653" ind1=" " ind2="6"><subfield code="a">Handbooks and manuals</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Programmierung</subfield><subfield code="0">(DE-588)4076370-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Online version</subfield><subfield code="a">Zingaro, Daniel</subfield><subfield code="t">Algorithmic thinking</subfield><subfield code="d">San Francisco : No Starch Press, 2020</subfield><subfield code="z">9781718500815</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-032638631</subfield></datafield></record></collection> |
id | DE-604.BV047234225 |
illustrated | Illustrated |
index_date | 2024-07-03T17:01:58Z |
indexdate | 2024-07-10T09:06:25Z |
institution | BVB |
isbn | 9781718500808 1718500807 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-032638631 |
oclc_num | 1249661549 |
open_access_boolean | |
owner | DE-573 DE-898 DE-BY-UBR DE-1043 |
owner_facet | DE-573 DE-898 DE-BY-UBR DE-1043 |
physical | xxix, 373 pages illustrations 24 cm |
publishDate | 2021 |
publishDateSearch | 2021 |
publishDateSort | 2021 |
publisher | No Starch Press |
record_format | marc |
spelling | Zingaro, Daniel Verfasser aut Algorithmic thinking a problem-based introduction by Daniel Zingaro San Francisco No Starch Press [2021] xxix, 373 pages illustrations 24 cm txt rdacontent sti rdacontent n rdamedia nc rdacarrier 2010 Hash tables -- Trees and recursion -- Memoization and dynamic programming -- Graphs and breadth-first search -- Shortest paths in weighted graphs -- Binary search -- Heaps and segment trees -- Union-find "An introduction to solving problems with algorithms and data structures, using competitive programming examples. Topics covered include recursion, dynamic programming, graphs, greedy algorithms, heaps, hash tables, segment trees, and other data structures for efficiently handling data"-Provided by publisher"-- Programmierung (DE-588)4076370-5 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Computer algorithms / Problems, exercises, etc Computer programming / Problems, exercises, etc MATHEMATICS / General Computer algorithms Computer programming Problems and exercises Handbooks and manuals Algorithmus (DE-588)4001183-5 s Programmierung (DE-588)4076370-5 s DE-604 Online version Zingaro, Daniel Algorithmic thinking San Francisco : No Starch Press, 2020 9781718500815 |
spellingShingle | Zingaro, Daniel Algorithmic thinking a problem-based introduction Hash tables -- Trees and recursion -- Memoization and dynamic programming -- Graphs and breadth-first search -- Shortest paths in weighted graphs -- Binary search -- Heaps and segment trees -- Union-find Programmierung (DE-588)4076370-5 gnd Algorithmus (DE-588)4001183-5 gnd |
subject_GND | (DE-588)4076370-5 (DE-588)4001183-5 |
title | Algorithmic thinking a problem-based introduction |
title_auth | Algorithmic thinking a problem-based introduction |
title_exact_search | Algorithmic thinking a problem-based introduction |
title_exact_search_txtP | Algorithmic thinking a problem-based introduction |
title_full | Algorithmic thinking a problem-based introduction by Daniel Zingaro |
title_fullStr | Algorithmic thinking a problem-based introduction by Daniel Zingaro |
title_full_unstemmed | Algorithmic thinking a problem-based introduction by Daniel Zingaro |
title_short | Algorithmic thinking |
title_sort | algorithmic thinking a problem based introduction |
title_sub | a problem-based introduction |
topic | Programmierung (DE-588)4076370-5 gnd Algorithmus (DE-588)4001183-5 gnd |
topic_facet | Programmierung Algorithmus |
work_keys_str_mv | AT zingarodaniel algorithmicthinkingaproblembasedintroduction |