A Gentle Introduction to Algorithm Complexity Analysis

Re:A Gentle Introduction to Algorithm Complexity Analysis by modernerd on Thursday June 14, 2018 @03:15AM (#17309948)

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/cha...

- Big O: https://livebook.manning.com/#!/book/grokking-algorithms/cha...

[ Parent | on HN ]

Re:A Gentle Introduction to Algorithm Complexity Analysis by ultrasounder on Thursday June 14, 2018 @04:38PM (#17315155)

THIS 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.

[ Parent | on HN ]

Re:A Gentle Introduction to Algorithm Complexity Analysis by vram22 on Thursday June 14, 2018 @05:34PM (#17315598)

>It doesn't assume any knowledge and even re-introduces logarithms and binary search before using them in examples

So does the OP.

[ Parent | on HN ]