Brest State Technical University, Course "Contemporary Intelligent Information Technology (CIIT)"

From students' works (2014)

To minimize the number of comparisons to sort 16 items Hillis (1992) a smart idea of using 15 pairs of 32-bit binary chromosomes each of these 4-bits is called "codon" expressing the number from 0 to 15. If, e.g., two codons of a corresponding position of a pair are 05 and 12, then it means comparison of 5th item and 12th items. Thus, if a pair is, for example
(0010 1000 1101 0111 1111 0110 1101 1011)
and
(1111 0111 0010 0111 1001 0100 1110 1010)
like the very first pair of Samasonaw's result below, this means the 8 comparisons of
02<->15, 08<->07, 13<->02, 07<->07, 15<->09, 13<->14 and 11<->10