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).
Vincent
"Hard to" is implementation detail and not part of any algorithm. A
translation table goes a long way in implementing your example efficiently.
_______________________________________________
fpc-devel maillist - fpc-devel@lists.freepascal.org
http://lists.freepascal.org/mailman/listinfo/fpc-devel