Asymptotic Analysis

* Asymptotic Analysis refers to computing the running time of any operation in mathematical units of computation.

 ㅁ Best Case − Minimum time required for program execution.
 ㅁ Average Case − Average time required for program execution.
 ㅁ Worst Case − Maximum time required for program execution.

* Following are the commonly used asymptotic notations to calculate the running time complexity of an algorithm.

 ㅁ Ο Notation
 ㅁ Ω Notation
 ㅁ θ Notation

* Big Oh Notation, Ο

- Worst Case 를 이용해 알고리즘 실행에 필요한 최대 시간을 나타냄 (상한선)

O(1)   <   O(logn)   <   O(n)   <   O(nlogn)   <   O(n^2)   <   O(2^N)   <   O(n!)

* Omega Notation, Ω

- Best Case 를 이용해 알고리즘 실행에 필요한 최소 시간을 나타냄 (하한선)

* Theta Notation, θ
 

- 알고리즘 실행에 필요한 최소, 최대 시간을 나타냄 (상한선 + 하한선)

* 출처 : https://www.tutorialspoint.com/data_structures_algorithms/