Efficient optimal pagination of scrolls

Diehr and Faaland developed an algorithm that finds the minimum sum of key length pagination of a scroll of n items, and which uses O(n log n) time, solving a problem posed by McCreight. An improved algorithm is given which uses O(n) time.