It's not straight C code because it's Perl. Perl's default sort algorithm(s) are implemented in C, not Perl. Anytime you reimplement a built-in function in Perl, it'll be slower than if you used the default. It doesn't matter if you use mod_perl, as the big gain there is avoiding startup time.
Regexp optimization is another subject altogether!
In reply to Re: Re: Re: Changing Perl's sort Default
by chromatic
in thread Changing Perl's sort Default
by @rocks
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |