Hard time sorting things? Difficulties to decide on an order?
Demo: Task Tinder
Task Tinder finds a Hamiltonian path in an intransitive set by letting you pick a winner between two options multiple times.
Just check out the demo.
Implementation
The sorting is done by an implementation of the semi-heap sort algorighm by Jie Wu. The repository contains a Ruby and a JavaScript version, both unit tested.
More resources
There's more than one algorithm to solve this problem. Maybe it's worth trying out another one.
- http://www.imada.sdu.dk/~jbj/DM19/turnering.pdf
- http://leonid.shevtsov.me/en/a-human-driven-sort-algorithm-monkeysort
- http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.110.8715&rep=rep1&type=pdf
- www.jsingler.de/studies/COMP5704/Slide_Presentation.ppt
- http://www.gossamer-threads.com/lists/python/python/159253?do=post_view_threaded#159253
License
All software in this repository is available under the MIT license. See the LICENSE file for more info.