Quick Select | Time and Space | Data Structure and Algorithms in JAVA

NADOS also enables doubt support, career opportunities and contests besides free of charge content for learning. In this video, we have explained how to quick select in Time and Space in Java.

#pepcoding #java #programming

[TheNishant]

not only does he explain the algorithm so well, he also turns into a spirit so as to not block the screen from the students. I've never seen a more dedicated teacher.

[techskeletons]

you explained it so well that i couldn't resist myself from liking the video!!!!

[AkashKumar-jlsw]

Bahut acha bhai thank you aapne hindi me samjhaya !!

[SCRIPTSAG]

Sir after sorting bhi to find ker sakte hai esme hi like hme 3rd find kerni hai to hem her bar length-3 ki call kernge pichle wale function me aur fir last me jeb array sortred ho jayega to wo return krega jo hme chahiye

[yashrajsingh]

sir i think you have misinterpreted the concept of partionins it correctly gives the pivot but does not provides correction position of the element iin array

[somith]

sir ur content is more nice than gfg codes i got this in concept thanks to u

[parthgupta]

please include time and space complexity also in the video

[SCRIPTSAG]

Sir apne ek condition kem ker di if else lga ker nhi to quick sort se bhi ho jata am I right

[amarnathbarpanda]

Sir, please make a video on quick sort with a random pivot element ... it's really confusing.

[aryangrover]

Sir, Why we are taking k as index. I think Is it because the numbers are from 1 to 8. Agar koi aur Random Numbers hote Fir ton yeh kaam nhi krega na
Tab ton Indexing badal jayegi
fir kaise krenge??
Like Numbers are 4, 6, 12, 33, 34, 22, 11, 9, 1
Isme Nikaalna ho fir?

[LegitGamer]

sir agar kth largest nikalna hai tho fir that will be n-k+1th smallest and then rest of code is same right

[kushagrapandey]

sir the complexity in wort case here is o(n square) right?

[arpitsohar]

Sir, ye question website pe nahi hain ab? aise hi Partition vala bhi ni h

[rishabhgoyal]

sir TLE error aa rha hai .. gfg pr submit krte hue same code ko .. what todo @pepcoding

[satyamchauhan]

We can do it using heaps more efficiently in (n-k)log(k) time

[warriorpanda]

To my understanding, the pivot has to be the last element in our range.

We cannot chose our pivot randomly, it necessarily has to be the last element for this algorithm to work (i.e. to get the pivot at the correct position in the array were sorted).

[yashsharma]

Sir can we use this approach to solve kth smallest distance problem (Leetcode)?

[arshadmanxoori]

sir,
int pivot = arr[hi]; kyuu lia arr[lo] le skte h?? agr int pivot = arr[lo] le rhe h to wrong aa rha h

[sagargarg]

if we are provided with a sorted array, I think its time complexity would go to O(n^2). please correct me if I am wrong

[arpitgupta]

Good Evening Sir.
Sir the algo will not work if at the last of an array, there exist already the largest number.
please clear it ..