Algorithmic thinking : a problem-based introduction / by Daniel Zingaro.
Material type:
TextPublisher: San Francisco : No Starch Press, [2021]Description: xxix, 373 pages : illustrations ; 24 cmContent type: - text
- still image
- unmediated
- volume
- 9781718500808
- 1718500807
- 9781718500808
- 005.13 ZIN 2021 23
- QA76.9.A43 Z56 2020
| Item type | Current library | Call number | Copy number | Status | Date due | Barcode | |
|---|---|---|---|---|---|---|---|
Book
|
Symbiosis International University, Dubai | 005.13 ZIN 2021 (Browse shelf(Opens below)) | 1 | Available | SIU01179 | ||
Book
|
Symbiosis International University, Dubai | 005.13 ZIN 2021 (Browse shelf(Opens below)) | 2 | Available | SIU01320 | ||
Book
|
Symbiosis International University, Dubai | 005.13 ZIN 2021 (Browse shelf(Opens below)) | 3 | Available | SIU01321 | ||
Book
|
Symbiosis International University, Dubai | 005.13 ZIN 2021 (Browse shelf(Opens below)) | 4 | Available | SIU01322 | ||
Book
|
Symbiosis International University, Dubai | 005.13 ZIN 2021 (Browse shelf(Opens below)) | 5 | Available | SIU01323 |
Browsing Symbiosis International University, Dubai shelves Close shelf browser (Hides shelf browser)
|
|
|
|
|
|
|
||
| 004.6782 MIL 2023 Cloud Computing Playbook : 10 In 1 Practical Cloud Design With Azure, Aws And Terraform | 005.068 HAR 2018 The business value of software / | 005.068 HAR 2018 The business value of software / | 005.13 ZIN 2021 Algorithmic thinking : a problem-based introduction / | 005.13 ZIN 2021 Algorithmic thinking : a problem-based introduction / | 005.13 ZIN 2021 Algorithmic thinking : a problem-based introduction / | 005.13 ZIN 2021 Algorithmic thinking : a problem-based introduction / |
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"-- Provided by publisher.
There are no comments on this title.