What about using a counting or layered Bloom filter? They also gives a probabilistic confirmation that the sorted list contains the same elements as the unsorted one.<p>Another solution, if the goal is to verify the sort algorithm, is to augment the sort data with position information (which isn&#x27;t used in the sort), then use that to confirm that each of the original elements is used.