She does not even get confused explaining such complex topics🤯

beautifully covered all the important points in the shortest time possible, thanks a bunch!

Thank you Keerti for this amazing compilation!😁

Excellent. Keerti you have explained sort wonderfully.

This is exactly what I was looking for. Thanks.

This is the best video of comparison of properties of Sorting Algos on youtube

Discovered this channel a few days ago and I can say that this is a gem of a channel. Thanks for existing!

Very Comprehensive Tutorial.Thank you

I appreciate your effort and scope of mind.

Thankyou so much ma'am for the amazing explanation. Even Better than paid course tutorial

Hi Keerthi, thank you for this cheat sheet video which is really very helpful and covers almost all commonly used sorting algorithms. I request you to please double check on the Selection Sort pseudo code, from your explanation, it seems the swap(a, b) function should be called after completion of the first for loop. Please revisit. Thanks again.

One of the things the MIT algorithms course suggested with quick sort, is that you can first shuffle the list, then sort. That way it will be better than n² and it's most cases better than nlogn.

3 way quick sort is also known as dutch national flag algorithm 🤩

THanks for sharing details I think in slection sort algo swap function should be outside the inner for loop...

Thank you very much ma'am!

Thanks for bringing together all the sorting algorithms . Very informative and a perfect cheat-sheet.

Your explanation is really good . Thanks a lot for making DSA and algorithm easy for us

Super Mam...Thank you

Thank you so much. It is very helpful. And, yes please do a video on non-comparison sorting the same way you did this one.

Informative video! Didn't know about 'Online' case before. Thanks for sharing 🤠

Your explanation is very clear! Kudos to you.

Can you please suggest one good on DSA in java for beginners ?

The heap sort code shown shouldn’t have the nested loop right?

Wow mam, amazing and professional explanation. Love from Pakistan

Thank you

It was a very informative comparison maim.

Awesome video

excellent comparison video Mam

Thank you so much

Thank You ❤

Perfect video

Thanks for the video, Quicksort has a SC of O(log n) though.

Can you provide the code for heapify function?

Very nice sorting algorithms' compilation @Keerti. Such videos should've been available since my college time..lol..😄Please keep posting such useful tips & insights tuts. 😇

Thank you ma'am 😃

Osm explanation 👍❤️

Really helpful Thank you :)

thank you

This is crisp and good video on algorithms.: Can you please make a video on Design patterns for java

Thank youuu !!

I love your this content video dear ❤️ i need revision so this vide helps me

Thank you so much for your videos!!! You explain concepts with great clarity! I have a clarification. At 5:52 the line swap(arr[min_idx], arr[i]); is not meant to be in the 'if' statement right? It is in the 'for' loop and out of the 'if' statement, yes? I wrote down each iteration according to the pseudocode given and it didn't add up.

for quick sort Aux SC is O(1)? can you explain?

Thank you ma'am . I hope to become a SWE one day like you

Space complexity of quick sort should be O(n) ? And since quick sort is much like merge sort it too would require extra space wouldn't it ?

this is really very helpful !!! Thank you so much !!

Very much helpful! Will you continue the 1 minute short tutorials? And yes a video on non comparison based shorting algorithms is very much helpful. Thank you ma'am for your efforts.

Great

amazing content..u got a new subscriber :)

for selection sort the swap should happen outside of the second loop within the first just to let people know the pseudo code is wrong

Best sorting algorithm video..🤟🤟.i reached this video from Linkedin. 😁😁

TQ mam

Great Video. I am a GATE aspirant and will be using this cheat sheet for my exam. Thank you keep making such videos.

Wow i just found your youtube channel from LinkedIn recommendation, it's really great , I just started with dsa on gfg.

So beautiful teaching ❤just looking like a wow

Underrated video

Thanks for making this video ma'am ❤️ Separate video for different sorting Algo would be great

life saver

nice explanation good work

In Your video Voice (beautiful and attractive) + content (useful) so this video is awesome

Hello ma'am. Many companies are using parser or screener for resume shortlisting .It happens several times that parser is unable to extract all the skills, projects and achievements properly due to which we don't get chance for interview.Can you guide us on how to make proper resume so that all information gets properly extracted?

This is such a great video. You missed out nothing.😊

Great cheat sheet Keerti 👍

After long time keeeti is come back with full time video. Try to choose trees nd graph and make a complete list. I'm big fan you. Love you from bottom of the heart

Heap sort will be O(n) best case if you use an array that is all of the same number, [2,2,2,2,2,2]

this is amazing thanks Keerti :) Can you please share videos on general recursion too ?

great videos mam very informative..can you also upload videos on tricky graph questions or how to approach

Great Keerti 👍

thanks a lot for the video :) As thejas suggested please do a video on recursion also. Really appreciate your efforts.

Awesome!

Madam,, I want to know one thing, what programmers really do in their job work..??

damn thanks !!

Wow.. Super.. Fantastic.. Marvelous.😂 Keep it up...:) And don't forget to make a video on comparison of non-comparison sort algos..😀 Hope it will be next video :p

quick sort m bhi toh auxillary space consume hota hai kyuki recursion call ho rha h toh stack ke size jitna toh space consume hoga hi n

Must watch be4 interviews 🐹💯

why didnt I see this before amzing

Hi Keerthi, your videos and explanation are awesome, i have one problem i am trying to solve for long days but I can solve in n2 time only, can u please solve this question in an efficientway. Given a two dimensional array of string-like => completed Where the first string is “child”, second string is “Father”. And given “ronaldo” we have to find his no of grandchildren Here “ronaldo” has 2 grandchildren. So our output should be 2. This question recently asked in a Zoho interview.

👍

Umm, can you make some videos on number theory also, I am a complete noob so...... And a video on how to approach a problem with its inputs, outputs and test- cases.

Mam you are soo beautiful 💖

A Screenshot segment at end would have been helpful

Please make video on comparison of count sort,radix sort etc..

I think the code for selection sort is not correct.

Link for implementation : www.hackerearth.com/practice/algorithms/sorting/

gem

Mam you look like a heroine you are so beautiful

And ur voice

Mam U r too cute 😍

777

For everyone studying for finals, you got this! God bless! ❤

Watched this video thrice, reason being the girl is so pretty, half of the time I was just lost at looking at her rather than focussing on sorting algs... ;

behan video me filter kyu lga liya

baap re inko toh bilkul padhana nhi aata ....knowledge hai pr teaching skills bhot he kharab hai

Ur english is not understandable

Thank you