Posted by Jeffrey_2Pi on July 12, 1999 at 00:12:18:
When the author includes the time required for the assignment of a larger integer to curlarge in the constant c, is this because we are concerned with the worst-case scenario of a strictly increasing array where array[n+1] > array[n], for all n? Is that why
T(n) != (c1)n + (c2) where c1 would be the time required to increment i, and c2 would be the time required to do the assignments?
Xmp 3.1 is on pages 43-44