
REFERENCES

D. E. Knuth, Art of Computer Programming, Vol. 3, 2nd. edition, Sect. 5.3.1.
Marcin Peczarski, Sorting 13 Elements Requires 34 Comparisons, Proc. of the 10th European Symp. on Algorithms (ESA), vol. 2452 of Lecture Notes in Comput. Sci., pp. 785794. Springer, 2002.
Marcin Peczarski, New Results in MinimumComparison Sorting. Algorithmica 40(2):133145, 2004.
E. Reingold, J. Nievergelt and N. Deo, Combinatorial Algorithms, PrenticeHall, 1977, section 7.4, p. 309.
Tianxing Tao, On optimal arrangement of 12 points, pp. 229234 in Combinatorics, Computing and Complexity, ed. D. Du and G. Hu, Kluwer, 1989. [Finds a(12).]
