  We consider the problem of inserting a new item into an ordered list of N-1
items. The length of an algorithm is measured by the number of comparisons it
makes between the new item and items already on the list. Classically,
determining the insertion point requires log N comparisons. We show that, for N
large, no quantum algorithm can reduce the number of comparisons below log N/(2
loglog N).
