286 views
3 votes
3 votes

This is a snapshot from coreman.

Here if i want to prove this example

$2n^2$ = $o(n^2)$

And if i take c=3,

then 

$2n^2$ < $3n^2$

Now for all n0 and c=3 it will hold and this will be true .I know this proof i gave is wrong.But  what exactly is  wrong ?

Please log in or register to answer this question.

Related questions

5 votes
5 votes
1 answer
1
rahul sharma 5 asked Oct 18, 2017
662 views
T(n) = 4T(n/2) + n2.$\sqrt{2}$In thetha notation?
0 votes
0 votes
5 answers
2
Deepalitrapti asked Aug 27, 2018
594 views
Any condition for f(n) and g(n) or any value we can take??? I m confused becoz in big oh right side part must b greater than equal ??
4 votes
4 votes
1 answer
3
Manish Chetwani asked Oct 23, 2017
358 views
What will be the Big Oh for $n!$ ?As we can deduce log($n!$) = O(log n) .Is there any proof like we have for log($n!$) ?
2 votes
2 votes
1 answer
4
vivek9837 asked Oct 18, 2016
2,967 views
Why doesn't the small $\theta$ notation exists ?