J
Jon Harrop
Erik said:Besides, just because one implementation/algorithm is asymptotic worse
than another does not mean that it'll *not* perform better for all
practical sets of inputs, quicksort for one is O(n^2) which is worse
than mergesort, but often performs better.
Ok, maybe there is a platform and implementation and benchmark out there
where this is faster using the C++ approach but we haven't encountered in
in cartography or scientific visualization on any of 32- or 64-bit Intel,
AMD, PPC and Linux, Mac OS X or Windows.
I think this is an asymptotic complexity that you hit very early on. I have
not benchmarked our code rendering a single trivial object, when C++ might
be faster. In fact, when you're rendering a trivial scene, this code will
not be the bottleneck so the performance will at least be almost identical.