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.
In reply to Re^12: Re-orderable keyed access structure?
by BrowserUk
in thread Re-orderable keyed access structure?
by BrowserUk
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |