4 ms·
The explanation of Big O in Grokking Algorithms was clearest for me. It doesn't assume any knowledge and even re-introduces logarithms and binary search before
by modernerd 8y ago
The explanation of Big O in Grokking Algorithms was clearest for me. It doesn't assume any knowledge and even re-introduces logarithms and binary search before using them in examples:
- Logarithms and binary search: https://livebook.manning.com/#!/book/grokking-algorithms/chapter-1/ https://livebook.manning.com/#!/book/grokking-algorithms/cha...
- Big O: https://livebook.manning.com/#!/book/grokking-algorithms/chapter-1/87 https://livebook.manning.com/#!/book/grokking-algorithms/cha...
- ultrasounder 8y agoTHIS book was my first serious introduction to anything BigOh. Playful yet dead nuts on the mission to introduce self taught programmers like me the fundamentals the right way.
- vram22 8y ago>It doesn't assume any knowledge and even re-introduces logarithms and binary search before using them in examples So does the OP.