Amazon cover image
Image from Amazon.com

Algorithmic thinking : a problem-based introduction / Daniel Zingaro.

By: Publisher: San Francisco : No Starch Press, 2021Description: xxix, 373 pages : illustrations ; 24 cmISBN:
  • 9781718500808
  • 1718500807
Subject(s): DDC classification:
  • 005.13 23
LOC classification:
  • QA76.9.A43 Z56 2021
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.
Summary: "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"--
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 3.8 (4 votes)
Holdings
Item type Current library Home library Call number Copy number Status Date due Barcode Item holds
Book Book Ayesha Abed Library General Stacks Ayesha Abed Library General Stacks 005.13 ZIN (Browse shelf(Opens below)) 1 Checked out 09/07/2024 3010040953
Book Book Ayesha Abed Library General Stacks Ayesha Abed Library General Stacks 005.13 ZIN (Browse shelf(Opens below)) 2 Checked out 11/07/2024 3010040954
Book Book Ayesha Abed Library General Stacks Ayesha Abed Library General Stacks 005.13 ZIN (Browse shelf(Opens below)) 3 Checked out 08/07/2024 3010040955
Book Book Ayesha Abed Library General Stacks Ayesha Abed Library General Stacks 005.13 ZIN (Browse shelf(Opens below)) 4 Checked out 08/07/2024 3010040956
Book Book Ayesha Abed Library General Stacks Ayesha Abed Library General Stacks 005.13 ZIN (Browse shelf(Opens below)) 5 Checked out 07/07/2024 3010040957
Total holds: 0

Includes bibliographical references and index.

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

CSE

There are no comments on this title.

to post a comment.
Share