Every recursion can be rewritten as a loop, avoiding calls and parameter passing can result into considerable speed gain.
Cheers Rolf
( addicted to the Perl Programming Language)
In reply to Re: quick sort. How do it faster
by LanX
in thread quick sort. How do it faster
by builat
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |