Most efficient way of randomly choosing a set of distinct integers
I'm looking for the most efficient algorithm to randomly choose a set of n distinct integers, where all the integers are in some range [0..maxValue]. Constraints: maxValue is larger than n, and possibly much larger I don't care if the output list is sorted or not all integers must be chosen with equal probability My initial idea wa...