A Gentle Introduction to Algorithm Complexity Analysis
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:<p>- Logarithms and binary search: <a href="https://livebook.manning.com/#!/book/grokking-algorithms/chapter-1/" rel="nofollow">https://livebook.manning.com/#!/book/grokking-algorithms/cha...</a><p>- Big O: <a href="https://livebook.manning.com/#!/book/grokking-algorithms/chapter-1/87" rel="nofollow">https://livebook.manning.com/#!/book/grokking-algorithms/cha...</a>