Homework Help is Here – Start Your Trial Now!
Engineering
Data Structures and Algorithms
9. It is a common misconception that if f(n) (g(n)) then f(n) = O(g(n)) and if f(n) [10 pts] O(g(n)) then f(n) = (g(n)) These are false. Draw an example specifically for g(n) = 1. In other words draw a function f(n) such that f(n) Solution: (1) and f(n) ‡ O(1). 0.8 0.6 0.4 0.2 0.2 0.4 0.6 0.8 1

9. It is a common misconception that if f(n) (g(n)) then f(n) = O(g(n)) and if f(n) [10 pts] O(g(n)) then f(n) = (g(n)) These are false. Draw an example specifically for g(n) = 1. In other words draw a function f(n) such that f(n) Solution: (1) and f(n) ‡ O(1). 0.8 0.6 0.4 0.2 0.2 0.4 0.6 0.8 1

icon
Related questions
Question
9. It is a common misconception that if f(n) (g(n)) then f(n) = O(g(n)) and if f(n) [10 pts] O(g(n)) then f(n) = (g(n)) These are false. Draw an example specifically for g(n) = 1. In other words draw a function f(n) such that f(n) Solution: (1) and f(n) ‡ O(1). 0.8 0.6 0.4 0.2 0.2 0.4 0.6 0.8 1
Transcribed Image Text:9. It is a common misconception that if f(n) (g(n)) then f(n) = O(g(n)) and if f(n) [10 pts] O(g(n)) then f(n) = (g(n)) These are false. Draw an example specifically for g(n) = 1. In other words draw a function f(n) such that f(n) Solution: (1) and f(n) ‡ O(1). 0.8 0.6 0.4 0.2 0.2 0.4 0.6 0.8 1
Expert Solution
steps

Step by step

Solved in 2 steps with 1 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer