Question

Order the following list of functions by the big-oh notation _________.

A) f(n) = n², g(n) = n log n, h(n) = n
B) f(n) = n, g(n) = n log n, h(n) = n²
C) f(n) = n log n, g(n) = n, h(n) = n²
D) f(n) = n², g(n) = n, h(n) = n log n

Answer 1

The list of functions can be ordered by the Big O notation as follows: f(n) = n, g(n) = n log n, h(n) = n².

Step-by-step explanation:

The list of functions can be ordered by the Big O notation as follows:

1. f(n) = n, g(n) = n log n, h(n) = n²
2. f(n) = n log n, g(n) = n, h(n) = n²
3. f(n) = n², g(n) = n, h(n) = n log n
4. f(n) = n², g(n) = n log n, h(n) = n

To determine the order, we look at the growth rates of these functions as n approaches infinity. The function with the lowest growth rate is f(n) = n, followed by g(n) = n log n, and the highest growth rate is h(n) = n².