A01=Daniel Zingaro
Age Group_Uncategorized
Age Group_Uncategorized
algorithm
algorithms
Author_Daniel Zingaro
automatic-update
business
c programming
Category1=Non-Fiction
Category=UMB
clean code
code
coding
coding for beginners
computer
computer books
computer programmer gifts
computer programming
computer science
computers
COP=United States
cryptography
cyber
data
Delivery_Delivery within 10-20 working days
design
education
engineering
eq_bestseller
eq_computing
eq_isMigrated=2
eq_nobargain
eq_non-fiction
finance
functional programming
games
guide
hacking
how to
ideas
internet
Language_English
linux
logic games
math
math books
mathematics
maths
mba
numbers
PA=In stock
physics
Price_€50 to €100
problem solving
programmer gifts
programming
programming books
PS=Active
psychology
reference
security
self help
softlaunch
statistics
step by step
tech
technology
work
writing
Product details
- ISBN 9781718503229
- Dimensions: 177 x 234mm
- Publication Date: 23 Jan 2024
- Publisher: No Starch Press,US
- Publication City/Country: US
- Product Form: Paperback
- Language: English
Secure
checkout
Fast Shipping
Easy returns
Knowing how to design algorithms will take you from being a good programmer to a great programmer. This completely revised second edition teaches you how to design your own rocket-fast, right-for-the-task algorithms-minus the proofs and complex math. Forget the useless pseudocode and played-out examples you've seen in other books. Author and award-winning educator Dan Zingaro draws problems straight from online programming competitions to rigorously teach you all of the heavyweights you need to know, like hash tables, recursion, trees, graphs, and heaps. As he guides you to the perfect algorithmic solution for each unique programming puzzle, you'll build up a toolkit of go-to algorithms for quickly and correctly solving any problem you come across. The second edition features several entirely new chapters on dynamic programming and randomized algorithms, as well as more effective problems and enhanced explanations. Code examples are provided using the C language. Learn how to: Classify problems, choose data structures, and identify appropriate algorithms; Choose between data structures like hash tables, heaps, or trees, based on how they affect runtime and speed; Adopt powerful strategies like recursion, dynamic programming, and binary search to solve challenging problems; Apply the breadth-first search algorithm to find the optimal way to play a board game, Dijkstra's algorithm to determine the fastest routes between two locations, and many more.
Dr. Daniel Zingaro is an award-winning associate professor of mathematical and computational sciences at the University of Toronto Mississauga. He is well known for his uniquely interactive approach to teaching and internationally recognized for his expertise in active learning. He is also the author of Learn to Code by Solving Problems (No Starch Press) and co-author of Learn AI-Assisted Python Programming.
