Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
Ordering Functions by Order of Growth Put the functions below in order so that each function is big-O of the next function on the list. fi(n) = (1.5)" f2(n) = 8n² +17n² +111 We solve this exercise by successively finding the function that grows slowest among all those left on the list. fa(n) =(log n)² f.(n) = 2" f, (n) = log (log n) f.(n) = n° (log n)' f, (n) = 2" (n² +: fa(n) = n° + n(log n) f, (n) = 10000 fio (n) = n! f, (n) =10000 (constant, does not increase with n) fs (n) = log (log n) (grows slowest of all the others) f.(n) = (log n) (grows next slowest) f.(n) = n° (log n)' (next largest,(log n)' factor smaller than any power of n) f.(n) = 8n' +17n? +111 (tied with the one below) fa (n) = n² +n(log n) (tied with the one above) f (n) = (1.5)" (next largest, an exponential function) f.(n) = 2" (grows faster than one above since 2 > 1.5) f, (n) = 2" (n² +1) (grows faster than above because of the n² +1 factor) 3 fio (n) = n! (n! grows faster thancn for every c)

Ordering Functions by Order of Growth Put the functions below in order so that each function is big-O of the next function on the list. fi(n) = (1.5)" f2(n) = 8n² +17n² +111 We solve this exercise by successively finding the function that grows slowest among all those left on the list. fa(n) =(log n)² f.(n) = 2" f, (n) = log (log n) f.(n) = n° (log n)' f, (n) = 2" (n² +: fa(n) = n° + n(log n) f, (n) = 10000 fio (n) = n! f, (n) =10000 (constant, does not increase with n) fs (n) = log (log n) (grows slowest of all the others) f.(n) = (log n) (grows next slowest) f.(n) = n° (log n)' (next largest,(log n)' factor smaller than any power of n) f.(n) = 8n' +17n? +111 (tied with the one below) fa (n) = n² +n(log n) (tied with the one above) f (n) = (1.5)" (next largest, an exponential function) f.(n) = 2" (grows faster than one above since 2 > 1.5) f, (n) = 2" (n² +1) (grows faster than above because of the n² +1 factor) 3 fio (n) = n! (n! grows faster thancn for every c)

Computer Networking: A Top-Down Approach (7th Edition)
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
See similar textbooks
icon
Related questions
Question

Ordering Functions by Order of Growth.

Prove that right column is given as a correct answer.

Ordering Functions by Order of Growth Put the functions below in order so that each function is big-O of the next function on the list. fi(n) = (1.5)" f2 (n) = 8n +17n² +111 We solve this exercise by successively finding the function slowest among all those left on the list. that grows fa(n) = (log n)² f.(n) = 2" fs(n) = log (log n) So(n) = n° (log n)' f, (n) = 2" (n² +1) fo (n) = n° + n(log n) f, (n) =10000 fio (n) = n! f, (n) = 10000 (constant, does not increase with n) fs (n) = log(log n) (grows slowest of all the others) f, (n) = (log n) (grows next slowest) f.(n) = = n° (log n) (next largest,(log n)' factor smaller than any power of n) f2(n) = 8n° +17n² +111 (tied with the one below) fa(n) = n° +n(log n) (tied with the one above) fi(n) = (1.5)" (next largest, an exponential function) f.(n) = 2" (grows faster than one above since 2 > 1.5) f, (n) = 2" (n² +1) (grows faster than above because of the n² +1 factor) 2 %3D f1o (n) = n! (n! grows faster thancn for every c)
Transcribed Image Text:Ordering Functions by Order of Growth Put the functions below in order so that each function is big-O of the next function on the list. fi(n) = (1.5)" f2 (n) = 8n +17n² +111 We solve this exercise by successively finding the function slowest among all those left on the list. that grows fa(n) = (log n)² f.(n) = 2" fs(n) = log (log n) So(n) = n° (log n)' f, (n) = 2" (n² +1) fo (n) = n° + n(log n) f, (n) =10000 fio (n) = n! f, (n) = 10000 (constant, does not increase with n) fs (n) = log(log n) (grows slowest of all the others) f, (n) = (log n) (grows next slowest) f.(n) = = n° (log n) (next largest,(log n)' factor smaller than any power of n) f2(n) = 8n° +17n² +111 (tied with the one below) fa(n) = n° +n(log n) (tied with the one above) fi(n) = (1.5)" (next largest, an exponential function) f.(n) = 2" (grows faster than one above since 2 > 1.5) f, (n) = 2" (n² +1) (grows faster than above because of the n² +1 factor) 2 %3D f1o (n) = n! (n! grows faster thancn for every c)
Expert Solution
steps

Step by step

Solved in 2 steps with 1 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY
SEE MORE TEXTBOOKS