A coherent explanation of why the mergesort algorithm Wikipedia has takes longer on lists of length 2^n+1 than on lists of length 2^n. This might be worth $50 too.