yates

Revolutionary Road -- Yates Yay, mentioned that one in two threads today and it's not even noon yet!

I haven't read it recently, but I feel compelled to recommend Revolutionary Road by Yates at every opportunity.

This eventually lead to the standard becoming a lot more tight in Yates v.

If I'm not mistaken, this sounds like an incremental fisher-yates shuffle.

Touching the Void is the story of Joe Simpson's epic climb on Siula Grande with Simon Yates.

If you are using Python, you should use the standard 'random.shuffle' which does use the Fisher-Yates algorithm.

I've seen in the piece of code corresponding to the Fisher-Yates algorithm this snippet: "n-- | 0".

The Fisher-Yates method lets you get the same results without messing with the array length.

This is just a partial Fisher-Yates shuffle[1] using a sparse sequence instead of an array.

The salt for the email could be a CRC, or a Fisher-Yates, or any of a dozen other novel one-way transformations.

This is an exciting product with a great team (especially founder Shireen Yates).

I thought it would be to shuffle playing cards, or perhaps an algorithm different than Fisher–Yates.

I've seen in the piece of code corresponding to the Fisher-Yates algorithm this snippet: "n-- | 0".

Reminds me of the "one day we'll move to France and become creative bohemians like we're surely meant to be" dream in Yates' Revolutionary Road.

"The Art of Memory" by Frances Yates is also a fascinating read.

) "For example, assume that your random number source gives numbers from 0 to 99 (as was the case for Fisher and Yates' original tables), and that you wish to obtain an unbiased random number from 0 to 15.

Touching the Void is the story of Joe Simpson's epic climb on Siula Grande with Simon Yates.

If you are using Python, you should use the standard 'random.shuffle' which does use the Fisher-Yates algorithm.

The Fisher-Yates method lets you get the same results without messing with the array length.