Sign in with Facebook
Aditya Y Bhargava’s Followers
None yet.
Aditya Y Bhargava
|
Grokking Algorithms, Second Edition
by |
|
* Note: these are all the books on Goodreads for this author. To add more, click here.
“O(log n) is faster than O(n), and it gets a lot faster once the list of items you’re searching through grows.”
― Grokking Algorithms, Second Edition
― Grokking Algorithms, Second Edition
“This is one of the unsolved problems in computer science. There’s no fast known algorithm for it, and some smart people think it’s impossible to have a smart algorithm for this problem.”
― Grokking Algorithms, Second Edition
― Grokking Algorithms, Second Edition
“for arrays, you have to shift all the rest of the elements down. And if there’s no space, you might have to copy everything to a new location! Lists are better if you want to insert elements into the middle.”
― Grokking Algorithms, Second Edition
― Grokking Algorithms, Second Edition
Is this you? Let us know. If not, help out and invite Aditya to Goodreads.
