January 2018
Intermediate to advanced
332 pages
7h 36m
English
Asymptotic Notations come in handy when we want to derive and compare the time complexity of two or more algorithms. What Asymptotic Notations mean is that, once we have the time complexity of an algorithm calculated, we are simply going to start replacing n (the size of the input of our algorithm) with a very large number (tending toward infinity) and then get rid of the constant from the equation. Doing this would leave us with the only factors that truly affect our execution time.
Let's take the same example as we did in the preceding section:
Tdouble = C1*(n + 1) + C2* n + C3; = C5 * n + C4 // where C4 = C3 + C1 and C5 = C1 + C2
When we apply the rules we just described relating to Asymptotic Notations, that is, ...
Read now
Unlock full access