Friday 20 October 2017

Angular simple routing example

Let's create a new project:

Analysis of algorithms

Let T(n) be a function on n=1,2,3...
T(n) = O(f(n)) if eventually for all sufficiently large n, T(n) is bounded above by a constant multiple of f(n).
T(n) = f(n) iff there exist constants c>0, N>0, such that T(n)>=cf(n) for all n>=N
O(f(n)) indicates the upped bound of a function, which both statements regarding the bubble sort are correct: T(n) = O(n*n) and T(n) = O(n*n*n)
What most algorithms designers usually interested in is θ(n).
Similarly to O(n), θ(n) is an asymptotic function. T(n)=θ(n) iff there exist constants c1>0, c2>0 and N>0, such that c1*f(n) <= T(n) <= c2*F(n)

Useful link
Useful course