29 Jun '17, 8pm

Find out what is going on behind the scenes when using Ruby's Array#shuffle method, via @jbrancha

The Fisher–Yates shuffle is an algorithm for generating a random permutation of a finite sequence—in plain terms, the algorithm shuffles the sequence. The algorithm effectively puts all the elements into a hat; it continually determines the next element by randomly drawing an element from the hat until no elements remain. The algorithm produces an unbiased permutation: every permutation is equally likely.

Full article: https://hashrocket.com/blog/posts/do-the-shuffle

Tweets

READ Data Using Ruby API Clients

rubyflow.com 29 Jun '17, 2pm

× The Ruby and Rails community linklog Made a library? Written a blog post? Found a useful tutorial? Share it with the Rub...

Scientists find world's oldest mushroom, aged 115 million years old

Scientists find world's oldest mushroom, aged 1...

treehugger.com 29 Jun '17, 6pm

It is no secret we TreeHuggers are big fungi geeks, and for good reason. Not only do they help maintain soil and plant hea...

Smart Quadcopters Find Their Way Without Human ...

ecnmag.com 28 Jun '17, 10pm

The FLA program is focused on developing a new class of algorithms that enables UAVs to operate in GPS-denied or GPS-unava...

Is #FineArt Going To The Dogs, Or Are The Dogs....

mitrofineart.com 29 Jun '17, 2pm

Don't leave your head is about the fact that although we might dance through our lives in complete ignorance of our true s...

Using Nanotubes to Strengthen 3D Prints

hackaday.com 30 Jun '17, 8am

3D printing has brought the production of plastic parts to the desktops and workshops of makers the world over, primarily ...

Babies go diaper-free with the 'elimination communication' potty-training method

Babies go diaper-free with the 'elimination com...

treehugger.com 26 Jun '17, 11am

It's an old technique that was practiced by previous generations, but has been lost in the U.S. since the 1960s. As Rosema...