The Quicksalt Is a Recursive Procedure to Do Something

The idea of the quicksalt is just that you have a list of elements in random der it selects a pivot, and then it's a kind of amazing recursive function. And when it's all done, everything has been asorted just by dividing them into the category of pivot,. things less than the pivot and things greater than equal o the pivot, over and over again. So so you have an augarithm. I guess it's a way of arranging random numbers and order. Is that right? Yes. What's interesting is we just went from something which is intangible and abstract, the algaritm, to an implementation, right? Which it ultimately is is ir a