
Ford-Johnson Algorithm: Sorting with the Fewest Comparisons Possible
A deep dive into the Ford-Johnson merge-insertion sort algorithm — how pairwise comparison, recursive sorting, and Jacobsthal-ordered binary insertion combine to minimize the worst-case comparison count. Implemented as cpp09 ex02 at 42 School.




