======================================================
Generally the time complexities of the algorithms are expressed with following notations :
- Big Oh denotes "fewer than or the same as" iterations.
- Big Omega denotes "more than or the same as" iterations.
- Big Theta denotes "the same as" iterations.
- Little Oh denotes "fewer than" iterations.
- Little Omega denotes "more than" iterations.