in reply to quick sort. How do it faster
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)
|
|---|
| Replies are listed 'Best First'. | |
|---|---|
|
Re^2: quick sort. How do it faster
by builat (Monk) on Oct 20, 2013 at 03:04 UTC |