1
Big-O Notation
•We use a shorthand mathematical notation to
describe the efficiency of an algorithm relative
to any parameter n as its “Order” or Big-O
–We can say that the first algorithm is O(n)
–We can say that the second algorithm is O(n2)
•For any algorithm that has a function g(n) of the
parameter n that describes its length of time to
execute, we can say the algorithm is O(g(n))
•We only include the fastest growing term and
ignore any multiplying by or adding of constants
Docsity.com
