In average case upperbound the value of c must be 5 but you provide 4 for the c value which does not satisfy the condition when c=4 and n=1 apart from that video is excellent
What a great video ❤ You have taken just around 11 mins to well explain what my doctor in university took around 3.5 hours to explain! Thank you so much ❤
After a longtime to see you sir,my second year b.tech I seen your videos on oops and other stuff .at that time because of you I can clearly understood the concepts Tq u sir for coming back....ur explanation and way of teaching is just awesome 👍😁
Though your teaching style is awesome, but the explanation is not correct.. we will not use Big oh as worst case , Omega as best case..Big oh or Omega or theta alone can be used for best, worst, average..
Hey......I think you are confused... Let me explain it for you... Big O notation specifically describes the worst case scenario. It represents upper bound running time complexity of an algorithm.....
@@remitheworst9085no, you can use either Big O, Omega or Theta to represent Worse Case, Best Case and Average Case consecutively.. its wrong to say Big Oh is the Worse Case as you Equate it to upper bound.. Upper bound is not a representative of Worse Case as if you plug it in in any of the mathematical definition of either of the NOTATION… In the mathematical definition, UPPER BOUND can be the LOWER BOUND and AVERAGE BOUND at the same time BUT you cannot say that WORSE CASE can be the BEST CASE and the AVERAGE CASE too cause that will never happen.. I hope I made it clear…the first comment was right..enjoy your DSA!
omg..... what a wrong explanation..... bro you need to be clear that worst case time complexity is not the upper bound. what do you mean by best case upper bound?
![Time Complexity of Algorithms and Asymptotic Notations [Animated Big Oh, Theta and Omega Notation]#1](/img/logo.svg){kind=logo}
