5 ms·
MonkeySort (2012)
- ballenf 8y agoWould 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.
- zentiggr 8y agoI think an Android app called Prioritize Me did something functionally similar. Haven't looked it up again recently.
- SketchySeaBeast 8y agoI've tried it in Chrome, Firefox, and Edge and has script errors in Chrome and Firefox, and just doesn't work in Edge.
- S-E-P 8y agoFirefox Nightly works just fine
- MagnificentSpam 8y agoIn firefox you can click the site security information thing in the address bar and then select "Disable protection for now". My firefox sets the Upgrade-Insecure-Requests header and loads the https site instead, I guess that's what makes the difference between browsers.
- SketchySeaBeast 8y agoYup, that worked!
- fpanettieri 8y agoInteresting read! I find it funny how we approach this same problem every ~5 years. (https://stackoverflow.com/questions/164831/how-to-rank-a-million-images-with-a-crowdsourced-sort 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/ 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 :)
- dsamarin 8y agoI 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/ https://jsfiddle.net/dsamarin/hgdjwtck/ [1]: https://stackoverflow.com/questions/8535540/exactly-how-many-comparisons-does-merge-sort-make https://stackoverflow.com/questions/8535540/exactly-how-many...
- fhood 8y agoMy god! In the end I was the monkey.
- mlthoughts2018 8y agoIt was Earth all along...
- sannee 8y agoDoes this avoid asking questions that would make the relation not a partial ordering? Is it even possible to implement that?
- gnulinux 8y agoYes, you can store old answers and report error when one of the axioms of poset is violated.
- moreira 8y agoI 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.
- logfromblammo 8y agoWith the default list, one is eventually asked "Which one is better?" with the options "best" and "better". Obviously, I'd choose the exact match.
- wumms 8y ago"Do you want to cancel?" <OK> <Cancel>
- luizfzs 8y agoWas I the only one that clicked on 'better' every time because it was actually the word requested on the statement?
- anderskaseorg 8y agoA Ford–Johnson merge-insertion sort would need 28% fewer comparisons on average than the quick sort used here. https://en.wikipedia.org/wiki/Merge-insertion_sort https://en.wikipedia.org/wiki/Merge-insertion_sort
- ggchappell 8y agoHere we go again: the latest in a long line of sites that I can't figure out, while lots of others comment "cool". I click "Sort it". Nothing happens. <sigh> For all those silent folks who are just like me: know that you are not alone.
- deleted 8y ago[deleted]
- eertami 8y agoQ: How do you tell if someone doesn't use Javascript? A: They will tell you.