Big O notation & Array

Complexity Analysis : Programmer은 아래 2가지를 고민한다 How much time does this algorithm need to finish? How much space does this algorithm need to finish? Big-O Notation Big-O Notation gives an upper bound of the complexity in the worst case, helping to quantify performance as the input size becomes arbitrarily large n : input 사이즈 Constant Time O(1) Logarithmic Time O(log(n)) Linear Time O(n) Linearith..

원문링크 : Big O notation & Array