Algorithm to generate 1000 distinct integers in the range [0,8000]? [duplicate]

Answer 1

You can use a partial Fisher-Yates shuffle implemented using swaps. One of the nice features of this algorithm is that if you stop after k swaps, the first k numbers are a random sample of size k from the complete set.