[fpc-devel] Re: enumerators
thaddy at thaddy.com
Sun Nov 14 15:02:03 CET 2010
On 14-11-2010 13:22, Vincent Snijders wrote:
> would be evaluated every time. S
> the O(N^2) stems from the fact that it is hard to get the ith
> character in a a UTF8String in O(1). Suppose it is o(N), then the loop
> is O(n^2).
"Hard to" is implementation detail and not part of any algorithm. A
translation table goes a long way in implementing your example efficiently.
More information about the fpc-devel