Cargando…

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...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor principal: Zingaro, Daniel (Autor)
Formato: Electrónico eBook
Idioma:Inglés
Publicado: San Francisco : No Starch Press, [2021]
Temas:
Acceso en línea:Texto completo (Requiere registro previo con correo institucional)

MARC

LEADER 00000cam a2200000 i 4500
001 OR_on1162356676
003 OCoLC
005 20231017213018.0
006 m o d
007 cr cnu---unuuu
008 200717s2021 cau ob 001 0 eng
010 |a  2020031511 
040 |a DLC  |b eng  |e rda  |c DLC  |d RECBK  |d OCLCO  |d OCLCF  |d EBLCP  |d TEFOD  |d N$T  |d YDX  |d OCLCO  |d OCLCQ  |d OCLCO 
020 |a 9781718500815  |q electronic book 
020 |a 1718500815  |q electronic book 
020 |z 9781718500808  |q paperback 
020 |z 1718500807  |q paperback 
028 0 2 |a EB00812580  |b Recorded Books 
035 |a (OCoLC)1162356676 
037 |a EF1E56B1-697C-4E01-BA2E-42A33E111DAD  |b OverDrive, Inc.  |n http://www.overdrive.com 
042 |a pcc 
050 0 0 |a QA76.9.A43  |b Z56 2021 
082 0 0 |a 005.13  |2 23 
049 |a UAMI 
100 1 |a Zingaro, Daniel,  |e author. 
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 1 online resource 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
504 |a Includes bibliographical references and index. 
505 0 |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 |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"--  |c Provided by publisher. 
588 |a Description based on online resource; title from digital title page (viewed on January 22, 2021). 
590 |a O'Reilly  |b O'Reilly Online Learning: Academic/Public Library Edition 
650 0 |a Computer algorithms  |v Problems, exercises, etc. 
650 0 |a Computer programming  |v Problems, exercises, etc. 
650 6 |a Algorithmes  |v Problèmes et exercices. 
650 6 |a Programmation (Informatique)  |v Problèmes et exercices. 
650 7 |a COMPUTERS / Languages / C.  |2 bisacsh 
650 7 |a Computer algorithms  |2 fast 
650 7 |a Computer programming  |2 fast 
655 7 |a Problems and exercises  |2 fast 
776 0 8 |i Print version:  |a Zingaro, Daniel.  |t Algorithmic thinking  |d San Francisco : No Starch Press, [2020]  |z 9781718500808  |w (DLC) 2020031510 
856 4 0 |u https://learning.oreilly.com/library/view/~/9781098128197/?ar  |z Texto completo (Requiere registro previo con correo institucional) 
938 |a ProQuest Ebook Central  |b EBLB  |n EBL6180048 
938 |a Recorded Books, LLC  |b RECE  |n rbeEB00812580 
938 |a EBSCOhost  |b EBSC  |n 2383493 
994 |a 92  |b IZTAP