Big O Notation (Solved Problems) - Set 2

Algorithms: Big O Notation (Solved Problems) - Set 2
Topics discussed:
1. Two Solved Problems on Big O Notation.
Algorithm Playlist: • Design and Analysis of...
Follow Neso Academy on Instagram: @nesoacademy (bit.ly/2XP63OE)
Contribute: www.nesoacadem...
Memberships: bit.ly/2U7YSPI
Books: www.nesoacadem...
Website ► www.nesoacadem...
App ► play.google.co...
Facebook ► goo.gl/Nt0PmB
Twitter (X) ► / nesoacademy
Music:
Axol x Alex Skrindo - You [NCS Release]
#AlgorithmsByNeso #Algorithms #BigONotation

[@jayparth]

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?

[@mosammatanjumanaralota7668]

Love From ❤️🇧🇩🇧🇩🇧🇩

[@hamidnawaz6915]

but how do you choose value for c? Any specific logic behind that? Please help me understand that.

[@Molaleni]

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.

[@AreebaRiaz-j2u]

can't we solve the inequality simply rather than plugging values for n. (12:23)

[@s1rvansah]

you can, but I believe you have to draw that graph in your solution