Algorithm Efficiency
	• If we say: Algorithm A requires a certain amount of time proportional to f(N)... – this means that regardless of the implementation or computer, there is some amount of time that A requires to solve the problem of size N. – Algorithm A is said to be order f(N) which is denoted as O(f(N));