Upper Bound Lower Bound and Average Bound in Asymptotic Notation | GATECSE | DAA

[@falaknaaz2470]

Complex topics ,easy and detailed explanation sir,may Allah reward you for your valuable time and effort.

[@Lahitha]

After a long browsing I found this worthy..thank you for the efforts you put on for our understanding...

[@vikrammhaske1298]

voice is like sidharth malohtra

[@BEITO-OmDomadiya]

Sir thank you than you thank you so much muje asymptotic notation mein bahut confusion tha apne all clear kar diya

[@CivilianStar]

Great Teacher, A lot of love sir

[@storykingegc]

Sir ab jakar smjh aa gya , kai channel pr video dekha fir v nhi smjh aaya tha

[@somnathtiwari186]

These topics are the roots of computer science ,thanku sir

[@vaibhavdixit6005]

Best explanation ever 👌

[@sarangs722]

Excellent Explanation

[@prabhassla4237]

So smooth explanation... 😘😘😘

[@YashSharma-le3mo]

Best Content 😊

[@parthibbhattacharya1069]

Awesome teaching

[@kamyagupta4030]

Very nice thankyou ❤️

[@Nimbus2k_rider]

awesome video

[@marathilove2110]

Really good explanation

[@chandanam4029]

Nice job

[@rkkashyap7263]

MCA ki tyari ke liye Nimcet par bhi video banaiye please

[@rkkashyap7263]

Very nice video sir

[@mrudul5018]

worthy video 💯💯

[@altafansari3129]

great

[@rafayasif1508]

Vip❤

[@anawarkhan2938]

Supper

[@falaksajjad4910]

❤

[@Atul101-oss]

sir 1/n possible nahi hoga

[@jayprakash9861]

Kyu itna complicate kr rhe ho sidha bolo na🤣🤣🤣 Upper bound : The maximum time a program can take to produce outputs, expressed in terms of the size of the inputs (worst-case scenario). Lower bound : The minimum time a program will take to produce outputs, expressed in terms of the size of the inputs (best-case scenario).