sorry to be off topic but does anyone know of a trick to get back into an Instagram account?? I was stupid forgot my password. I would love any tips you can offer me!
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.
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
@@KeertiPurswani First of all ThankYou for the response. In the list i want 1. Tell the theory about topics 2. Choose a qstn from Leetcode nd solve it. 3. And suggest some follow up questions. Edit : similar to stock buy and sell video.
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.
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.
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.
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
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?
@@KeertiPurswani yes the general concept on recursion in visualizing the stack frame and maybe an example to find all paths from a source to a destination in a 2d grid will be really helpful :)
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 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.
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... ;
Hi Prasanna, The app that you are using now? And all the apps you use on your phone/laptop/tv are few of the things that we develop and we do much more 😇 We basically make lives more easier, interesting and fascinating 🤭
She does not even get confused explaining such complex topics🤯
Discovered this channel a few days ago and I can say that this is a gem of a channel. Thanks for existing!
Means so much to me Ankit. Made my day ❤️
sorry to be off topic but does anyone know of a trick to get back into an Instagram account??
I was stupid forgot my password. I would love any tips you can offer me!
@@jedidiahkevin4197 😑
😂
@@gaganprakash4071 bhai aapka aaj exam hai kya?
3 way quick sort is also known as dutch national flag algorithm 🤩
Yup!!😇😇
This is exactly what I was looking for. Thanks.
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.
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
beautifully covered all the important points in the shortest time possible, thanks a bunch!
Thankyou so much ma'am for the amazing explanation. Even Better than paid course tutorial
Your explanation is very clear! Kudos to you.
Thanks Dinesh 😇
Excellent. Keerti you have explained sort wonderfully.
THanks for sharing details
I think in slection sort algo swap function should be outside the inner for loop...
I appreciate your effort and scope of mind.
Thanks for bringing together all the sorting algorithms . Very informative and a perfect cheat-sheet.
Thank you so much! Glad you liked it! 😇
@@KeertiPurswani looking forward to more cheat sheets like this.
Best video I have seen so far related to this topic.
Thanks for the video, Quicksort has a SC of O(log n) though.
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.
Very Comprehensive Tutorial.Thank you
Best sorting algorithm video..🤟🤟.i reached this video from Linkedin. 😁😁
Thank you!! Hope you like other videos as well 😇
Informative video! Didn't know about 'Online' case before. Thanks for sharing 🤠
Thank you!! 😇
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
Means just so much to me!!!❤️❤️
What all would you like in the list?
@@KeertiPurswani First of all ThankYou for the response.
In the list i want
1. Tell the theory about topics
2. Choose a qstn from Leetcode nd solve it.
3. And suggest some follow up questions.
Edit : similar to stock buy and sell video.
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.
Yes I will!
Many videos coming up 🙂
@@KeertiPurswani ok then give your onlyfans account
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]
Wow i just found your youtube channel from LinkedIn recommendation, it's really great , I just started with dsa on gfg.
So glad you like it! ❤️
Your explanation is really good . Thanks a lot for making DSA and algorithm easy for us
So glad I can help 😇😇
Wow mam, amazing and professional explanation. Love from Pakistan
Thank you Keerti for this amazing compilation!😁
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
plzzz correct me if iam wrong
logn hogi space complexity yes@@K.TFITNESS
So beautiful teaching ❤just looking like a wow
It was a very informative comparison maim.
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 ?
Great Video.
I am a GATE aspirant and will be using this cheat sheet for my exam.
Thank you keep making such videos.
Awesome!! 😇😇😇
In Your video Voice (beautiful and attractive) + content (useful)
so this video is awesome
Thank you ma'am . I hope to become a SWE one day like you
Thanks for the awesome video
excellent comparison video Mam
this is really very helpful !!! Thank you so much !!
Glad you like it 😇😇
for quick sort Aux SC is O(1)? can you explain?
Great cheat sheet Keerti 👍
Glad you liked it! 😇
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.
Yeah, planning to start something for beginners!!
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.
I love your this content video dear ❤️ i need revision so this vide helps me
Please make video on comparison of count sort,radix sort etc..
Sure 🙂
The heap sort code shown shouldn’t have the nested loop right?
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.
Hi,
You can make a graph and traverse using BFS or DFS 😊
You can checkout my video on the same!
thanks a lot for the video :) As thejas suggested please do a video on recursion also. Really appreciate your efforts.
Sure! Thank you ❤️
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
Will make for sure!
Thank you!! 😇😇
This is such a great video. You missed out nothing.😊
nice explanation good work
Thank you 😇😇
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?
Yeah, this has been requested a lot. Will definitely do 🙂
Underrated video
This is crisp and good video on algorithms.:
Can you please make a video on Design patterns for java
Super Mam...Thank you
Osm explanation 👍❤️
Really helpful Thank you :)
this is amazing thanks Keerti :) Can you please share videos on general recursion too ?
When you say general recursion, you have any particular question in mind? Or the concept of recursion?
@@KeertiPurswani yes the general concept on recursion in visualizing the stack frame and maybe an example to find all paths from a source to a destination in a 2d grid will be really helpful :)
Sure!! 🙂
For everyone studying for finals, you got this! God bless! ❤
A Screenshot segment at end would have been helpful
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. 😇
Many videos coming up!! 😇😇
Link for implementation : www.hackerearth.com/practice/algorithms/sorting/
Can you please suggest one good on DSA in java for beginners ?
life saver
amazing content..u got a new subscriber :)
Great Keerti 👍
Thank you 😇
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.
yes ur right i guess, i too had the same doubt
Awesome video
Thank you very much ma'am!
Perfect video
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... ;
Madam,, I want to know one thing, what programmers really do in their job work..??
Hi Prasanna,
The app that you are using now? And all the apps you use on your phone/laptop/tv are few of the things that we develop and we do much more 😇
We basically make lives more easier, interesting and fascinating 🤭
Must watch be4 interviews 🐹💯
Thank you ma'am 😃
why didnt I see this before
amzing
Can you provide the code for heapify function?
great videos mam very informative..can you also upload videos on tricky graph questions or how to approach
Thanks Shweta. Will upload for sure! 😇😇🙏🙏
Thanks for making this video ma'am ❤️
Separate video for different sorting Algo would be great
Thank you 😇
Thank You ❤
Thank you
Great
Awesome!
Thanks 😇🙏
Thank youuu !!
Thank you so much
for radix sort?
I think the code for selection sort is not correct.
TQ mam
👍
Mam you are soo beautiful 💖
Mam you look like a heroine you are so beautiful
The answer is always BOGO
damn thanks !!
Mam U r too cute 😍
Lol thanks 🤭
@@KeertiPurswani Welcome Mam 😁😉
gem
And ur voice
777
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
Thank you