Algorithm Efficiency
•Some things to keep in mind when using this notation:
–You can ignore low-order terms in an algorithm's growth rate.
–For example, if an algorithm is O(N3+ 4*N2+3*N) then it is also O(N3). Why?
–Because N3 is significantly lager than either 4*N2 or 3*N...especially when N is large.
–For large N values...the growth rate of N3+ 4*N2+3*N is the same as N3
•