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 :)
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?
In 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.
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.
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 :)
reply