OK, I can see how an insertion algorithm is just as easy to make (and why
it's more intuitive).

But then again there's no real need to have it super fast anyway if it's
going to be just on the parse phase...

I understand all the stuff about O(n^2) and O(n*log n) too, he talked for a
fair while, hehe, actually I'm amazed I remember most of it... I wasn't
really paying attention at the time... hehe

--
Lance.

http://come.to/the.zone

Post a reply to this message