On 1/3/06, phoenixinter <[EMAIL PROTECTED]> wrote: > since just read this array takes O(n) > why is precalc O(n) important?
that was exactly my point ...:) For example, partial sum precalculation can be done while sorting without increasing the sort algorithm complexity (depending on the sorting algorithm used). bye ! mattia.
