Quick Select Algorithm | Efficient searching algorithm

This lecture shows the working and implementation of quick select algorithm. It is very similar to quick sort algorithm with respect to partition algorithm but much faster in terms of speed. PLEASE HELP us by SUBSCRIBING to our channel. If you have any VIDEO REQUEST then do comment below and i will try to upload a video for it as soon as i can. If you find any difficulty or have any query then do COMMENT below. PLEASE help our channel by SUBSCRIBING and LIKE our video if you found it helpful...CYA :)

[rjkal]

It was a good explanation. But you keep confusing with smallest and largest. It's hard to follow that way. You could've just stuck with either one of them and explained the other one in the end as an additional modification.

[tarujain]

Super video! I applauded for $10.00 👏👏👏

[Lucas_Bazilio]

Sir, please decide whether you are talking about the smallest or the largest. Otherwise it is very confusing.

[soumitramehrotra]

at 3:58, u r saying 5th largest element? you seem to be confused

[ashutoshtrivedi]

Best Explanation found till now. Thanks!

[anishapal]

also in case of finding kth largest for that we need to ignore the left and follow the right side of the pivot element

[VishalKumar-krme]

Very nice explanation. Only thing is that you said largest element every time instead of smallest.
Otherwise, it was a very good explanation

[devanshgoyal]

Sir, You really help a lot...
I clear all of my doubts from your videos
Thanks a lot...

[shubhanshusingh]

Explanation was quite well but you make lots of mistakes while explaining any algorithm atleast try to check before uploading and provide correction of anything's wrong.

[DragonOO]

Sir can u please make vedios on Greedy problems

[parulkhatri]

What if we take one Boolean variable to track swap, which means if no swap occur that array is sorted. It will reduce worst case time complexity as well in quick select. Correct me if I am wrong.

[CodeSuccessChronicle]

make a video on this problem < Trapping Rain Water >

[ManojKumar-hjfh]

This is a bit confusing, can you explain with elements greater than indices, like 23, 45, 43, 88, 93 ?

[sarfarazalam]

Easy explaination, thank you for the video :)

[ruchirjain]

when the algo is very simple but you break your back while trying to code it...

[ansaahmed]

Best explanation! Simple and precise!! :)

[ankuradhey]

What if pivot is found less than kth value ? This case was not covered.

[zhongchuxiong]

Hi, I like the blackboard app you used. Could you please tell me its name?

[安西教练-v]

what if after the eight, there is a three before five, in this case you find a value less than the pivot value 5, do you increase the pointer i?, if so then after the exchange, the 8 will be on the left side of 5.

[netsameergm]

Taking the last element as pivot is probably the worst way to explain partitioning to anyone.