Live data from Hacker News

MonkeySort (2012)

leonid-shevtsov.github.io

1–10 of 21 posts

Re: MonkeySort (2012)

#2
Would love to see the list order visually during the questions phase.

But regardless, this is useful for teaching sorting to help understand the comparison function's role that is passed into a sort routine.

Re: MonkeySort (2012)

#5
Interesting read!

I find it funny how we approach this same problem every ~5 years. (https://stackoverflow.com/questions/164831/how-to-rank-a-mil...)

I recently implemented a similar tool to help my team decide which brand and art references to use => http://refsort.com/

One big difference is that I focused on subjective topics, where there is no absolute 'correct' or 'better' option. In that case I think transitivity could actually decrease the quality of the result, so more 'brute force' is required.

I could probably implement this algorithm in a branch and see what happens :)

Re: MonkeySort (2012)

#6
I made this[0] a while back as an implementation of merge sort in JavaScript with continuation passing style. His seems very similar but uses quicksort. Surprising since merge sort has fewer comparisons than quicksort's average case[1]. Why exactly does he use a matrix to store the comparisons?

[0]: https://jsfiddle.net/dsamarin/hgdjwtck/ [1]: https://stackoverflow.com/questions/8535540/exactly-how-many...

Re: MonkeySort (2012)

#10
I love this, I've used it for years any time I need to rank things, since having to pick my preference between different options is much more accurate than giving them arbitrary numbers.
Post reply on HN