Optimisation, yes; premature, how? Please show me how maintenance or verifiability suffers in any way from picking this algorithm over the ST. Tuples would help the ST, but even if its key container overhead were much smaller, it’d still be O(n), whereas it’s O(1) for this algorithm.
Makeshifts last the longest.
In reply to Re^2: Better sorting than the ST
by Aristotle
in thread Perl is dying
by Anonymous Monk
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |