Time Complexity Notations
In this semester, I listened the course mit 6.006 in youtube channel. Duirng the course, the professor used different notations to represents time complexity of an algorithm. I learned Big O O(n) notation before, but for Big theta θ(n) and reccurence relations T(n), I never heard them before. Today, I hope I can finally figure them out. What T(n) represents the actual running time of an algorithm O(n) represents the asymptotic upper bound of the running time of an algorithm θ(n) represents the running time when asymptotic upper bound and lower bound of an algorithm ares the same. ...