Optimize Utilities::shuffle(..) and generalize it by making it templated.

Old version was slow when shuffling large string lists, because it did O(n) times random access operation (namely list[index]), which is linear time. => Total complexity O(n^2).

New version uses array instead of list. This makes random access constant time. => Total complexity O(n).