Using sentinels in insert sort

摘要

AbstractThe inner loop of insert sort can be simplified by using a sentinel value. We suggest a way of avoiding the extra storage normally required for the sentinel, and a way of avoiding the prior, and possibly restrictive, choice of its value. Algorithms are given in Pascal.