125 reputation
4
bio website
location
age
visits member for 1 year, 10 months
seen Apr 21 at 14:42

Apr
26
awarded  Tumbleweed
Jan
25
accepted Proving a graph contains a single node on a given level
Oct
4
asked Proving a graph contains a single node on a given level
Oct
4
awarded  Supporter
Sep
15
awarded  Scholar
Sep
15
comment Disproving big O
Unfortunately I don't have enough points to upvote yet but thanks a lot for your help.
Sep
15
accepted Disproving big O
Sep
15
comment Disproving big O
Great. I just had a question though. Shouldn't we be looking to prove 2^(2n) > 2^(c*g(n)) instead of 2^(2n) > c*2^n. I say this because by definition f(n) is O(g(n)). This means that f(n)<=c*g(n), thus, shouldn't both sides of this equation be raised to base 2. I don't see why the c should be ignored.
Sep
15
awarded  Student
Sep
15
asked Disproving big O