Last week is about Big-O.
Few things that very import:
(1) When we talking about running time in computer science, we talking about how many steps the code has to go through to give us desired output. Also, we cares when the input n gets really large, and how fast the running time goes up.
(2) We don't care the hardware influence, we only care the mathematical algorithm
(3) We don't care for small input n
(4) We don't care the constant or coefficient because as n goes large, n + a, n, cn(for some number a nd c) are same.
(5) We care the degree of n, because it determines how fast the function goes when n is large.
(6) The rate of change: quadratic> linear > log
(7) If in each iteration, n gets half, then the running complex function is log
No comments:
Post a Comment