logoalt Hacker News

willvarfarlast Thursday at 8:11 AM2 repliesview on HN

your random number function might return the same number multiple times? So to choose k random but unique numbers you may have to call the random number function more than k times?

Of course my intuition would be that you can do a random shuffle and then take the first k, which is O(N). So I might be misunderstanding.


Replies

chopinlast Thursday at 9:14 AM

Is there a O(n) shuffling algorithm? In place, I don't think so.

show 1 reply
minitechlast Thursday at 8:51 PM

You can do that for O(N), but the problem can be solved in O(k).