MOMENTAN AUSVERKAUFT
Über dieses Produkt
Product Identifiers
PublisherNo Starch Press, Incorporated
ISBN-101718500807
ISBN-139781718500808
eBay Product ID (ePID)28038629043
Product Key Features
Number of Pages408 Pages
Publication NameAlgorithmic Thinking : a Problem-Based Introduction
LanguageEnglish
Publication Year2020
SubjectProgramming / Algorithms, Programming / Open Source, General, Programming Languages / C
TypeTextbook
AuthorDaniel Zingaro
Subject AreaMathematics, Computers
FormatTrade Paperback
Dimensions
Item Height1 in
Item Weight27.2 Oz
Item Length9.2 in
Item Width7 in
Additional Product Features
Intended AudienceTrade
LCCN2020-031510
Reviews"A good choice for anyone who needs to understand and implement algorithms." --RedGreenCode "With Zingaro as a tutor by your side, you'll learn, through practice on challenging competition problems, a repeatable process for figuring out and deftly applying the most appropriate algorithmic tools for the job. You'll learn it all from a book that exudes clarity, humor, and just the right dose of Canadian pride. Happy problem-solving!" -- Dr. Tim Roughgarden, Professor of Computer Science at Columbia University
Dewey Edition23
IllustratedYes
Dewey Decimal005.13
Table Of ContentForeword Introduction Chapter 1: Hash Tables Chapter 2: Trees and Recursion Chapter 3: Memoization and Dynamic Programming Chapter 4: Graphs and Breadth-First Search Chapter 5: Shortest Paths in Weighted Graphs Chapter 6: Binary Search Chapter 7: Heaps and Segment Trees Chapter 8: Union-Find Chapter 9: Afterword Appendix A: Algorithm Runtime Appendix B: Because I Can't Resist Appendix C: Problem Credits Index
SynopsisReaders tackle challenging topics like recursion, dynamic programming, graphs, greedy algorithms, heaps, hash tables, segment trees, and other data structures for efficiently handling data. The book contains no pseudocode: all code is written in C and is thoroughly explained in the text (C is a de facto programming language for programming competitions). Zingaro also shows how several problems can be reduced to algorithms on graphs., A hands-on, problem-based introduction to building algorithms and data structures to solve problems with a computer., A hands-on, problem-based introduction to building algorithms and data structures to solve problems with a computer. Algorithmic Thinking will teach you how to solve challenging programming problems and design your own algorithms. Daniel Zingaro, a master teacher, draws his examples from world-class programming competitions like USACO and IOI. You'll learn how to classify problems, choose data structures, and identify appropriate algorithms. You'll also learn how your choice of data structure, whether a hash table, heap, or tree, can affect runtime and speed up your algorithms; and how to adopt powerful strategies like recursion, dynamic programming, and binary search to solve challenging problems. Line-by-line breakdowns of the code will teach you how to use algorithms and data structures like: - The breadth-first search algorithm to find the optimal way to play a board game or find the best way to translate a book - Dijkstra's algorithm to determine how many mice can exit a maze or the number of fastest routes between two locations - The union-find data structure to answer questions about connections in a social network or determine who are friends or enemies - The heap data structure to determine the amount of money given away in a promotion - The hash-table data structure to determine whether snowflakes are unique or identify compound words in a dictionary NOTE: Each problem in this book is available on a programming-judge website. You'll find the site's URL and problem ID in the description. What's better than a free correctness check?
LC Classification NumberQA76.9.A43Z56 2020
