★ /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.

>>97
http://link.springer.com/article/10.1007%2FBF01934989
Abstract
For almost twenty years, the Ford-Johnson algorithm for sortingt items using comparisons was believed to be optimal. Recently, Manacher was able to show that the Ford-Johnson algorithm is not optimal for certain ranges of values oft. In this paper, we present some new algorithms which achieve much stronger results compared to Manacher's algorithms.