Khosro Raúl Soleimani

9%
Flag icon
In this chapter You get a foundation for the rest of the book. You write your first search algorithm (binary search). You learn how to talk about the running time of an algorithm (Big O notation). You’re introduced to a common technique for designing algorithms (recursion).
Grokking Algorithms: An illustrated guide for programmers and other curious people
Rate this book
Clear rating