วีดีโอ

average case not discussed!

Thank You Maam!!

nicely explained worst case where many did not ! thanks..

Simple and straight forward. ❤❤❤

Can you also provide analysis of decending array worst case

Mam will you please upload next videos

Nice explanation but where's the AVG case

Best explanation ever

Thanks!

I don't know why your channel has few subscribers

mam for average ,when we say quicksort algorithm is average

Thanks

what is the array size is 7, then what will be the num of comparison because its coming 2.8073, how should I approach for the comparisons?

I didn't get the part where u used n/2 for the worst case could you explain it please

Great explaination

Thanks

thaaaaaaaaanks

amazing video thanks

💝

please do video on average case analysis for quick sort

with n=8; is there any chance we can generate best case array for a quick sort algorithm, please clarify? thank you. for example, we choose pivot as middle of array.

I have started watching your videos recently. You teach step by step and in an orderly manner. From this point of view, I can say that if you continue, you have potential to convert this channel in the top list of the youtube channels for learning CS concepts. Best of luck!

so does that mean that the worst case will change to nlogn if we take the median as pivot????

Madam when will you upload your next video... ?

you're the best ! thank you !

Very nice lecture 😊. One can understand easily

thank you mam

The best case running time of bubble sort O(n) or 0(n^2) This question given in previous examination I am so confused

Why the two loops will run u should have mentioned that no 🙂

Hi, Is there a way to solve this problem? Thank you. Derive the worst-case running time complexity of the following function: a(n) = { 1 for n ∈ {0, 1, 2, 3}, a(n) = a(n − 1) + a(n − 2) + a(n − 3) + a(n − 4) for n ≥ 4 .

Thank you so much Madam...We want more teachers like you....Absolutely, well explained...I didn't know whether it was easy or tough however you made it easy...Again, Thank you...

Are u not going to upload any videos in future?

Algorithm A and B have a worst-case running time of O(n) and O(log n), respectively. Identify the algorithm that runs faster and critically explain why

GREAT! IT WAS REALLY HELPFULL FOR ME. THAKS ALOTTTTTTTTTTTTTTTTTTTTTTTTTTTTTT

Good explanation mam. But I want average case too

Hi. Thank you very much for your lessons. They really helped me to understand the Big O topic and time and space complexity of algorithms. Thanks a lot.

Best video with clear cut explanation.Thanks for your video .Please Continue and do more videos .Dont Stop.

I was so confused about why the n was divided by 2 now i get it

Thanks

thank u

tysm

O(n)🙃

Why binary search is used only for ascending order why not descending order

Thanks✌🏻

what if we know m is bigger then n, is O(m) then?

thank you maam love it

very nice explanation and make a difficult concept simple to Understand thanks I subscribed to you and I hope you will upload nice content thanks

Thank you so much for helping me understand this basic concept :)