About Big O
Big O notation is a mathematical notation that describes the limiting behavior of a function when the argument tends towards a particular value or infinity. // by Wikipedia Big Os O(1) –> Constant- no loops O(n) –>Linear- for loops, while loops through n items O(log N) –> Logarithmic- usually searching algorithms have log n if they are sorted (Binary Search) O(n log(n)) …