Hacker News Reader

for JS you can probably just do `[...Array(n).keys()].sort(()=>Math.random() - 0.5)` ?

Having an unstable comparator might wreak havoc and maybe not give a proper distributed space of possible results?

Edit: yes, here is an example (in the comments) of how biased this is: https://stackoverflow.com/a/18650169/923847

That is exactly the algorithm that Microsoft used to bias its purportedly random “browser choice” screen. Don’t use it.

The Fisher–Yates shuffle is the right way to shuffle an array in an unbiased way.