September 12, 2005 Copyright ?2001-5 Erik D. Demaine and Charles E. Leiserson L2.23 A tighter upper bound? We shall prove that T(n) = O(n 2 ).