Sample without replacement: produce a randomly selected element of the list, and the list with that element omitted. If the list is empty, the selected element will be Nothing.

Shuffle the list using the Union-Find data structure with path compression algorithm. Takes O(n log n) space and time.