Be careful with that shuffle, it won’t yield truly random results because sort expects its comparator to uphold Math.sign(compare(a, b)) === -Math.sign(compare(b, a)). Microsoft once screwed up by using exactly that.
sort
Math.sign(compare(a, b)) === -Math.sign(compare(b, a))
What an interesting story! Thanks for sharing.
And yes, for any production code just use Fisher/Yates!
Are you sure you want to hide this comment? It will become hidden in your post, but will still be visible via the comment's permalink.
Hide child comments as well
Confirm
For further actions, you may consider blocking this person and/or reporting abuse
We're a place where coders share, stay up-to-date and grow their careers.
Be careful with that shuffle, it won’t yield truly random results because
sortexpects its comparator to upholdMath.sign(compare(a, b)) === -Math.sign(compare(b, a)). Microsoft once screwed up by using exactly that.What an interesting story! Thanks for sharing.
And yes, for any production code just use Fisher/Yates!