+49 (0) 541 / 40666 200

Sie erreichen uns Montag bis
Freitag von 8 bis 16 Uhr

 

Schreiben Sie uns eine Email oder benutzten eine andere Kontaktmöglichkeit
 Versandkostenfrei in Deutschland
Einkaufskorb
Keine Artikel
in Ihrem
Einkaufskorb

Algorithmic Thinking

A Problem-Based Introduction - 200 - 17644750

Taschenbuch von Daniel Zingaro

93644104
Zum Vergrößern anklicken

nur 37,49 €

Sie sparen 8,01 € (18 %) gegenüber dem alten Preis von 45,50 €
(portofrei!, inkl. MwSt.)

Widerruf zu diesem Artikel
  • Details
  • Beschreibung
  • Information zum Autor
  • Inhaltsverzeichnis
  • Bilder
Details
Artikel-Nr.:
93644104
Im Sortiment seit:
08.01.2021
Erscheinungsdatum:
08.12.2020
Medium:
Taschenbuch
Einband:
Kartoniert / Broschiert
Autor:
Zingaro, Daniel
Verlag:
Random House LCC US
Imprint:
No Starch Press
Sprache:
Englisch
Rubrik:
Informatik
Seiten:
373
Gewicht:
770 gr
Beschreibung
A hands-on, problem-based introduction to building algorithms and data structures to solve problems with a computer.

Programming is about using a computer to solve problems, and algorithms and data structures are the building blocks of computer programs. For each problem that a programmer wants to solve, they employ an algorithm: a sequence of steps for solving the problem. Many books teach algorithms independently of specific problems, but this book uses careful explanations, examples, and arguments, rather than formal mathematics and proofs which make it difficult for you to connect what you are learning to what you can do with that learning. Algorithmic Thinking: A Problem-Based Introduction teaches you to use the best algorithms and data structures for a given situation by walking you through solving problems pulled from international programming competitions, such as how to determine whether snowflakes are unique; how to win a game in the minimum number of moves; how to find the number of ways to get to someone's house; how to escape a cave in as few steps as possible; and so on.

You'll 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). By the end of the book, you should understand the importance of carefully working through a problem, and why it pays to organize data using data structures.
Information zum Autor
Dr. Daniel Zingaro is an award-winning Assistant Professor of Mathematical and Computational Sciences at the University of Toronto Mississauga, where he is well known for his uniquely interactive approach to teaching, and internationally recognized for his expertise in Active Learning.
Inhaltsverzeichnis
Foreword
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
Bilder