Quicksort works! Uses recursion.
Quicksort works! Uses recursion.

Note that it uses indices to swap values around. This might be suboptimal
as bound checks are performed. Ideally, iterators would be used instead.

nbigaouette/rust-sorting,nbigaouette/rust-sorting,nbigaouette/rust-sorting