Time complexity Analysis of Iterative Algorithms | Part-2 | GATECSE | DAA

[@abhilashp4439]

I would pay to watch your videos any day!!! Lakhs worth education for free!!! You will reach 1M subscribers quickly!!!!

[@Techy_Kite]

very clear and concise explanation, Thank you bro

[@laraamen656]

Thankyou so much you made everything so easy i wish university teachers could take a course from you

[@kambojritu84]

Superb videos

[@NileshKumar-oo7pu]

Great sir. 😃

[@vinaymalik2056]

please create a playlist of computer organization and architecture as soon as possible because I have back in COA

[@yaswanthkumar4362]

Thank you sir this video cleared a lot of doubts. Can you please make a video for this kind of equations also please Express the following function in terms of Big-oh notation: 1. (n) + 50 × n^2 + 50 2. (n^2) + 50 × n^2 + 21n^2

[@THEGATEHUB]

1. (n) + 50 × n^2 + 50 = O(n^2 ) 2. (n^2) + 50 × n^2 + 21n^2 = 72 × n^2 = O( n^2 ) for further communication you can contact me at instagram (instagram.com/ahmadshoebkhan/) or linkedin (www.linkedin.com/in/ahmad-shoeb-957b6364/)

[@ergamesonn]

Bhaiyaaa mai aapka bahutttt bada fan hu..... Plzzz bta digiye kaise gate mei accha perform kre, coaching online ya offline kre? Aur iit paane jitna accha performance kaise laaye

[@THEGATEHUB]

Thanks a lot for your appreciation.. For further communication you can contact me at instagram..

[@srishtisingh2327]

Fantastic... But I am waiting for the rest of the videos.😢😢