I owe this man my cs degree. Greatest teacher of the generation

Hello Sir, Please write a book on Algorithms with the topic you covered . Your simple way of explaining complex topics is must have reference for a professional and student. I sat an entire semester trying to understand concepts like Big O , until now no one properly explained how log came inside Big O, no one talked about Frequency count method and taking degree of the polynomial. Keep up the good work and we expect a really good book from you. Just do the same what you wrote on the board to a book as it is instead of bringing in unnecessary Maths symbols like other university professors. When you explain each and every step unlike other lazy Maths teachers who skip steps, makes you a really good teacher.

@at2031

4 жыл бұрын

@@abdul_bari yeeeeah. I agree with the guy. You explained the topic in such a simple way.

@simonedisalvatore6832

3 жыл бұрын

may i do that, i'll post it

@humblefool8564

3 жыл бұрын

@@simonedisalvatore6832 yas please

@abraralharbi6835

2 жыл бұрын

I completely agree with you

@samiranroyy1700

2 жыл бұрын

Ye ssir

Sir, u r really the best professor i ever encounter! I think u should have more courses on Udemy! Hopefully on all areas of Computer Science! I think there is a serious lack of someone who is able to teach in a way that is simple to understand. Please be the one to fill in this gap and i believe the Computer Science community will be very happy :)

Post breakup and abdul is my guru now. You've done the world a great service sir, and I thank you with all I have for that.

Your videos are absolutely of finest quality. I have not encountered a teacher that convey information in such a simple, yet thorough matter as you do.

1:42 He can tell I'm impressed and he doesn't even know me

@abdul_bari

3 жыл бұрын

😁😁😁

I felt relaxed when he stops after saying something and looking at camera 😂😂

@zameerrizvi7762

3 жыл бұрын

Need people like to smile while studying 😂🤓

@intuitivej9327

3 жыл бұрын

Same here

@zameerrizvi7762

3 жыл бұрын

@unknown in that way u can learn fast u dumb

@amank8950

3 жыл бұрын

@unknown bruhh, wtf are you even saying

@lullubi5957

3 жыл бұрын

😂😂😂

Sir, I have tried to learn about Asymptotic notations for a long time now. But wasn't able to grasp the concept. Thanks to you, I can now understand these.❤️

scratching my head "how to get into competitive programming" and I find your videos!

Sir, your videos on Algorithm Analysis are simply amazing. Thank you so much for making such a wonderful videos, which are very useful.

You are wonderful, Professor Bari. You are helping me SO much. I wish I had you worked at my Uni!

Sir , the way of your teaching is amazing, you explained complex concepts in an easy and interactive way. Thank you, so much Sir ✨

You just saved my grade in real variables. Please keep making more videos, you'll never know who you'll save

best explanation I have ever seen so far. little bit of correction log(1*1*1 up to n times will be 1 ) so lower bound should be zero

abdul bariji thank you so much. what a fantastic teacher you are. crisp and clear explanations.

thank u sir...for making it so simple...i have a huge confusion on this topic but after watching ur video on assymptotic notation...i understand the whole concept..ur way of explaining is very simple..

This is one of the great explanation on Asymptotic Notations. Thank you so much Sir.

No dislike represents how good u teach us. Many many thanks from Bangladesh...

@integralcialbay4633

3 ай бұрын

Bruh, this looks like a troll comment now

This is great sir. I am finally learning algorithms properly through your videos.

Absolutely incredible, thank you so much

I purchased udemy course by paying 89$ and didn't understand. Of after explanation this genius man, all concepts are cleard and it's became easy to code too. Thanks a lot sir. You'll always be remember by me♥

Thanks sir...your videos really helped to clear the concept of time complexity and asymptomatic notation

You're so much more efficient than my algorithms professor, thank you !

Asalaam alikum sir after a long time i find such video from which i understand asymptotic notation JazakAllah sir

sir thank you so much. You made my concepts so clear. Tomorrow I have an exam and you save me. May you have everything in your life you want. Bless you

Today I finished this video. Well explained sir i tried graphing and I understood clearly but to understand more clealy when there is no theta bound I have to see how graph differs for different lower bounds with n factorial example. Hats off to you sir.

Sir your video made my asymptotic notation concept very strong....thank you

thank you for the series. I am planning to go on with the series till the end because its that good. However, i do have a suggestion on how this series can become even better. It would have been great if you provided some problems to solve after you finish teaching a certain topic. and then also provide solution to those problems so that we could check if we got it right. Incase we don't get it right, we can correct ourselves by looking at how you solve it.

Sir, do you have tutorials for any other course? I want to know because, the way you explain any topic is very clear.

Hello sir superb explanation .Way to go hope in future you make more videos hope your teaching will reach every corner of the world. No words to say

*Sorry sir your videos are so intresting that I always forget to hit on the like button.* Thank you sir for all these content. You are a blessing for me.

Best video on youtube. Thank you so much for making this amazing video!

Life saver! This was a great instruction on the topic!! Thank you!

Thank you so much for uploading these, you teach very well!!!

Sir, all lectures are of best quality. Thank you for your efforts and soon I am applying for First Job and I will update you soon my status because your videos really help a lot.

@jagadeeshmandala4097

3 жыл бұрын

These videos helpful?

@brandonjoy6494

2 жыл бұрын

DId you get the job, Ganesh?

@atharvan2260

2 жыл бұрын

Did you get the job Ganesh! INDIA WANTS TO KNOW!!!

@vimalkumar281

Жыл бұрын

why we put log 1 as 1 instead of 0

Thank you professor. These are some spectacular explanations.

You're the best teacher! Thanks for this video it helped me a lot !!

frequency count method was not able to understand but your videos a lot help . you are awesome sir and this video too

Now I don't regret for not listening to online classes! Thank you sir:)

ultimate style of teaching sirji.a big thanks to you.

Great, clear and simple explanation. Big thanks.

I just love your style of explaining 😍

Thanks a lot sir. I understood this concept very well. You are a good teacher.

Thank you, sir your explanation is very clear and on to point . I'am very excited to learn data structures from your Udemy course.

How amazing your explanations are!!!

Thank you Sir. I can't believe you made it so easy to understand.

Again an excellent video. At 5:08 onward, I think there is a place for n! on that scale ( well depending on what that scale is) n^k < 2^n < n! inf thus the n^k < 2^n < n!

@animerank4907

3 жыл бұрын

That's correct, I was confused when he said that we can't put factorial anywhere.

@tontacchi

Жыл бұрын

We can go even simpler. My Algorithms class just covered the fact that n! can be bounded to n^n. It can be shown that (n/2)^(n/2)

I just increased the playback speed and your content was still understandable,that is sonething we don't see regularly keep up the good work sir

You are the best, you saved me. Thank you So much.

Sir literally you save me , a big thank you from my side. 🙏🙏🙏🙏🙏🙏

Sir also for n factorial we can take omega(n)

i honestly felt like giving up in my cs degree, and then you showed up on my page. I hope you know you made me feel hopeful!

Bro is so humble its so comforting

Thank you sir ....U are easy way to understand to us ....Like dis type of related videos will upload more sir

You are very good teacher sir. Thank u for this algorithms course. I request you to keep your courses free as this one.

@ErenYeager-yq3mm

2 жыл бұрын

Yup

In coding interviews, they expect you only to analyse the O() condition. The reason being they themselves do not know how to analyse the other two, secondly it is not always possible to come up with a theta. But the prior reason is the most prevalant. I am watching your videos instead of reading CLRS.

sir you are my favourite. YOU teach algorithms like cakewalk.

this man da goat he carryin all of us through college

5:10 - but you can same the same thing for n^2 and 2^n. Because if you use any number below 3, n^2 will be greater than 2^n. So it all depends on the value of n...

Excellent progression and crystal clear content. Thanks!

@VinodKumar-sh8tm

3 жыл бұрын

sala

Very well explained, Thanyou so much from USA. PS: My professor sucks , doesnt explain anything at all .

@SunilYadav-yt9ri

2 жыл бұрын

@unknown LOL

Perfect! Thank you so much!

you are one of my best teacher

Thank u for uploading this video ....this was very much helpful

you are the best of all

This man is so good. Wow!

Sir By watching this lectures I just bow down to you

Excellent content as other videos. Thanks a lot sir.❤❤

Sir your way of teaching is very simple and good

Sir you are blessing to us !!

You are a life saver. Thank you sir!

Cristal clear concept Thank you sir 🙏

Sir please make a course on Competitive Programming on udemy.

are bahut OP sir ji. Maja hi aa gaya

What I don't understand is why is everything converted to n on the right for upper bound and 1 to the left for lower bound (4:22). Is there a specific reason we do that? For example, what if for n! i did something like n!/2 By the way amazing content!!. very helpful and concise. Very easy to understand.

@sb_infi

2 жыл бұрын

Bro did u find ur answer?? If yes then what is the reason??

@sb_infi

2 жыл бұрын

I think it is not in the "class" sir talked-about

very helpful keep doing sir!

THANK YOU ABDUL SIR, YOU'VE SAVED MY LIFE

Sir, in the examples why we are not taking omega(n) instead of omega(1) ?

The best ever explanation 👏

thanks sir loved the way you explain...adbhoot!!!!!!!

very neatly explained 👌👌

I wish you have a video on proving by Limites.

the video is literally awesome ..... and the example of mobile phone.....

thank you so much❤❤, I was struggling to know the difference

The best explanation 👍🏻

sir can we take any value between 1 and n^n in the function n!

great lectures sir hats off

Thank you I learn lots from your learnings❤

sir continue your video , we are geeting problem in linear searching, stack as well as much more

❤ Very Helpful. Keep up the good word Sir.

You are awesome. Thank you.

Sir you are really good teacher

Wow sir These lectures are very simple and easy to understand I wish our teachers taught us in the same manner Thank you so much and I appreciate you for what you are doing These lectures helped me a lot

Thank you very much. You are a genius. 👍👍🔝🔝👌👌🙏🙏

thanks for the video. my only question is, isn't log1 = 0? you said it was equal to 1 and wrote omega(1) but I believe it is supposed to be omega(0) ?

So it does mean that these three notation are used to put any uncategorial function in some category such as n or n^2 or any category mentioned in comparison of functions is these the meaning of this notations

Great Sir, do you have any data structure tutorial? please let me know

Awesome ....thanks for helping

Great teaching sir. Thanku

Nicely explained sir...