C-1.2 Describe how to modify the MaxsubFastest algorithm so that it uses just a single loop and, instead of computing n+1 different M values, it maintains just a single variable M.
C-1.3 What is the amortized running time of the operations in a sequence of n operations, assuming that the cost of each operation is constant otherwise?