Searches: Efficiency

Problem : Define "Big-O notation".

Problem : Prove that the function f (n) = n ² + 3n + 1 is O(n ²) .

Problem : You are given two functions, one which has an average case running time of O(n ²) and the other which has an average running time of O(nlogn) . In general, which would you choose?

Problem : True or false: A function with O(n) efficiency will always run faster than a function with O(n ²) efficiency?

Problem : Draw a graph showing how n , logn , n ² , and 2ⁿ compare as n increases.

Solution for Problem 5 >>

Figure %: Graph of the rates of growth

Close