in reply to Re^11: Re-orderable keyed access structure?
in thread Re-orderable keyed access structure?

By all means rewrite the recursive routines iteratively and re-run the benchmark, but to be realistic, you would need to run this one.

However, even if the iterative approach was 3 orders of magnitude faster than the recursive (which I strongly doubt), it still leaves the original problem of how to retain keyed access to the data stored in the array after it has been re-ordered.

Examine what is said, not who speaks.
"Efficiency is intelligent laziness." -David Dunham
"Think for yourself!" - Abigail
"Memory, processor, disk in that order on the hardware side. Algorithm, algorithm, algorithm on the code side." - tachyon
  • Comment on Re^12: Re-orderable keyed access structure?

In Section Seekers of Perl Wisdom