I've asked this before HERE, however I wish to have the explanation of quickselect (based on quicksort) simplified further. The previous question I asked included some example code (so you know what I'm on about).
I was wondering if anyone anywhere at any point had summarised the rules and guidelines of quickselect as a game, where one can learn how the algorithm works by following easily understood rules that can be applied to let's say a deck of cards or numbers on bits of paper.
I think a simplified explanation of the quickselect algorithm would be paramount to me understanding how it works, as still the tutorials and explanations I've received are difficult to grasp and visualise. Even the videos on youtube that turns quicksort into a dance haven't helped greatly.
Thanks in advance Stack, you've been a great help so far.