[Lecture 2] Asymptotic Notation, Algorithm Analysis
1. Asymptotic Notation
Here are some definitions to demonstrate the value trend of a function when the input N grows up .
The big-O notation defines a class of functions that have the same attribution :
if there are positive constants and such that when .
Note that 「」 here is not a tradition symbol 「equal」, which describes belongs to a set of functions satisfied with the requirement above.