Rank the following functions by asymptotic growth rate in non-decreasing order: f1(n) = 2^2^1000000; f2(n) = 2^1000000n; f3(n) = (n 2) f4(n) = n√n: Justify your answer! Example: The function f(n) = n grows asymptotically slower then the function g(n) = n2; that is, f(n) 2 O(g(n)), but g(n) 2 O = (f(n)). (ii) Using big O-notation show that n1+0;001 2 O = (n).
Rank the following functions by asymptotic growth rate in non-decreasing order: f1(n) = 2^2^1000000; f2(n) = 2^1000000n; f3(n) = (n 2) f4(n) = n√n: Justify your answer! Example: The function f(n) = n grows asymptotically slower then the function g(n) = n2; that is, f(n) 2 O(g(n)), but g(n) 2 O = (f(n)). (ii) Using big O-notation show that n1+0;001 2 O = (n).
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
Rank the following functions by asymptotic growth rate in non-decreasing order:
f1(n) = 2^2^1000000; f2(n) = 2^1000000n; f3(n) = (n 2) f4(n) = n√n:
Justify your answer!
Example: The function f(n) = n grows asymptotically slower then the function
g(n) = n2; that is, f(n) 2 O(g(n)), but g(n) 2 O = (f(n)).
(ii) Using big O-notation show that n1+0;001 2 O = (n).
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 3 steps