Quick Select - Basic Algorithms Fast (22) | Find the kth smallest element in an unsorted array

Let's learn quick select process, which searches for the kth smallest element in an unsorted array. In each pass, the quick select algorithm chooses the rightmost element of the current partition as the pivot, and moves it to the correct position in the sorted array. If the pivot index is smaller (larger) than the target index, we repeat the process in the partition on the right (left) of the pivot. If the pivot index is the same as the target index, the search is complete.

2:26 - Meaning of a partition
3:03 - Find the third smallest element

Playlist of my Algorithm walkthrough

Basic Python Fast

Playlist of my Python examples

Playlist of my Java course

Playlist of my Java examples

#quickselect #algorithm #begincodingfast #algorithmvisualization

[theolite]

this was so helpful, thank you so much