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
icon
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
steps

Step by step

Solved in 3 steps

Blurred answer
Knowledge Booster
Dynamic Multithreading
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education