Re: To increase speed on manipulating big arrays in Java with minimal bounds checking, ...

Hi,

Robert Klemme wrote:
For any finite problem size, O(n) can be worse than O(n^2).

Does the term O(n) make sense for finite problems? 

Of course:

 Big O is just about
asymptotic values.

Yes. But most (or even all?) algorithms are defined to *theoretically* run with an unlimited 'n', although *in practise*, 'n' is always finite, i.e. limited and not 'infinity'.

 And, yes, as I said, in practice the overhead may
indeed count. :-)


That's it!

Ciao,
Ingo

.