Chapter 18, Problem 52E

Explanation of Solution

Analogy of elephant and goldfish:

Big-O notation is also called the order of notation which represents the approximate computing time of the function as a notation.

• The highest power in the polynomial represents the Big-O complexity of algorithm.
• For example,
  • Consider the polynomial expression, ${\text{f(N)=N}}^{\text{3}}{\text{+ 50N}}^{\text{2}}\text{+ 10N + 25}$.
  • In the above expression, f(N) is of order N³, O(N³) in Big-O notation