Quality content and explanation as usual from Neso Academy ❣️. I do have a doubt though. How does one chooses testing input (n) especially how they knew which numbers to test on for the log n problem?
Here is my understanding. He said first look at the dominant term. Try to pick the tightest upper bound of g(n) according to f(n). Here you can also choose the value of c according to f(n) keeping in mind the definition of big O notation using trial and error verifying if the inequality holds for large n. I hope I did not confuse you.
I guess the care we have to take here is that c should be larger than multiplier constant in dominant term just to determine the exact asymptotic behaviour
@@s1rvansah yes you can even if you solve the inequality then you get the value of n is 3.16 (√10) this is the exact value if you implicitly put it in a equation then you find f(n) =g(n) with a value 20 And any value more than 3.16 Will prove that g(n) Is greater than f(n)
Quality content and explanation as usual from Neso Academy ❣️. I do have a doubt though. How does one chooses testing input (n) especially how they knew which numbers to test on for the log n problem?
but how do you choose value for c? Any specific logic behind that? Please help me understand that.
Here is my understanding. He said first look at the dominant term. Try to pick the tightest upper bound of g(n) according to f(n). Here you can also choose the value of c according to f(n) keeping in mind the definition of big O notation using trial and error verifying if the inequality holds for large n. I hope I did not confuse you.
I guess the care we have to take here is that c should be larger than multiplier constant in dominant term just to determine the exact asymptotic behaviour
Love From ❤️🇧🇩🇧🇩🇧🇩
can't we solve the inequality simply rather than plugging values for n. (12:23)
you can, but I believe you have to draw that graph in your solution
@@s1rvansah yes you can even if you solve the inequality then you get the value of n is 3.16 (√10) this is the exact value if you implicitly put it in a equation then you find f(n) =g(n) with a value 20
And any value more than 3.16
Will prove that g(n)
Is greater than f(n)