Use the Fisher-Yates algorithm to randomize lists

This ensures that the time required for the shuffling depends linearly
on the length of the list, rather than quadratically. Moreover, it
prevents memory allocations during the shuffling and thus saves time
even for very short lists.

REVIEW: 110262