# Big theta notation algorithm help

 0 I am facing a problem with this question. Lets assume, k > j > 2 and b > a > a. If g(n) is in a category that is listed below to the left of the category containing f(n), then show that g(n) is order of small oh of (f(n)) (that is g(n) is in the complexity class of little “oh” of f(n); that is, g(n) is in a complexity class that is “strictly smaller” than f(n) ) theta ( log n ) theta ( n ) theta ( n. log n) theta ( n^2 ) theta ( n^j ) theta (n^k) theta ( a^n ) theta ( b^n ) theta ( n! ) [factorial] Can anyone explain how can I proceed and solve this problem and what I actually need to know to solve this problem? It will be very helpful to me if anyone kindly explains with clear explanation and example. I also have confusion what Big Theta actually means? asked 28 Aug '16, 23:26 rudro09 11●3
Be the first one to answer this question!
 toggle preview community wiki:

By Email:

Markdown Basics

• *italic* or _italic_
• **bold** or __bold__
• image?![alt text](/path/img.jpg "title")
• numbered list: 1. Foo 2. Bar
• to add a line break simply add two spaces to where you would like the new line to be.
• basic HTML tags are also supported

Question tags:

×55
×38
×34
×3

question asked: 28 Aug '16, 23:26

question was seen: 1,106 times

last updated: 28 Aug '16, 23:26