Every algorithm with linear worst-case running time processes one million records within the laboratory's time limit on Machine M. Algorithm Z has linear average-case running time. The engineer concludes that Algorithm Z will meet the time limit even in its slowest case. Which assumption would justify the conclusion?