Here is a suggestion for what might be a truly optimal sorting algorithm. Pick the best set of comparisons for input lists of size 2 . Then pick the best set of comparisons for size 3 , size 4 , size 5 , and so on. Combine them together into one program with a big case statement. Is this an algorithm?

\subsection*{15.10 Projects}