random.seed(): What does it do?
I am a bit confused on what random.seed() does in Python. For example, why does the below trials do what they do (consistently)?
random
Why does random.shuffle return None?
Why is random.shuffle returning None in Python?
How to get a random value from dictionary?
How can I get a random pair from a dict? I’m making a game where you need to guess a capital of a country and I need questions to appear randomly.
Weighted random selection with and without replacement
Recently I needed to do weighted random selection of elements from a list, both with and without replacement. While there are well known and good algorithms for unweighted selection, and some for weighted selection without replacement (such as modifications of the resevoir algorithm), I couldn’t find any good algorithms for weighted selection with replacement. I also wanted to avoid the resevoir method, as I was selecting a significant fraction of the list, which is small enough to hold in memory.
Generate random numbers summing to a predefined value
So here is the deal: I want to (for example) generate 4 pseudo-random numbers, that when added together would equal 40. How could this be dome in python? I could generate a random number 1-40, then generate another number between 1 and the remainder,etc, but then the first number would have a greater chance of “grabbing” more.
How to get a random number between a float range?
randrange(start, stop) only takes integer arguments. So how would I get a random number between two float values?
Generate a random date between two other dates
How would I generate a random date that has to be between two other given dates?
Generating a list of random numbers, summing to 1
This question is not a duplicate of Getting N random numbers whose sum is M because: Most answers there are about theory, not a specific coding solution in python to answer this question The accepted answer here is 5 years older than the one answer in the duplicate that answers this question. The duplicate accepted … Read more
Pick N distinct items at random from sequence of unknown length, in only one iteration
I am trying to write an algorithm that would pick N distinct items from an sequence at random, without knowing the size of the sequence in advance, and where it is expensive to iterate over the sequence more than once. For example, the elements of the sequence might be the lines of a huge file.
How to generate a random number with a specific amount of digits?
Let’s say I need a 3-digit number, so it would be something like: