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:- Logarithms and binary search: https://livebook.manning.com/#!/book/grokking-algorithms/cha...- Big O: https://livebook.manning.com/#!/book/grokking-algorithms/cha...