★ /prog/ challenge No. 666 ★ (Easy)

THE CHALLENGE:
Implement ``Tohosort'' (http://www.freewebs.com/tohosort/) ^{66in Lisp99} in your programming language of choice.

Post the source code of your implementation. It should at least read the input from stdin and print a sorted list after making the comparisons.

Deadline: 2013-01-21 00:00.

The programs will be judged by elegance, speed and number of comparisons made using a random list that will be published the day of the deadline. The winner will be awarded with Ten (10) שקליםSuss (that's Suss-shekels for you goyim), which is enough to pay the fee needed to cross the Sanzu River by ferry.

>>28
Or you could just read anything about sorting algorithms. The problem is literally just sorting a list using pairwise comparisons; i.e. the way nearly every sorting does it.
You can store other people's results to create a partly sorted list (and choose a sorting algorithm that works better on partly sorted lists), but even that isn't very interesting.