Oh - and sorting in Perl can occasionally be more efficient than sorting in the database. The reason is that, depending on the implementation, the database will sort by copying the values from one section of memory to another. Perl sorts by moving pointers around. With larger datasets, Perl's way could be faster.
------
We are the carpenters and bricklayers of the Information Age.
Then there are Damian modules.... *sigh* ... that's not about being less-lazy -- that's about being on some really good drugs -- you know, there is no spoon. - flyingmoose
I shouldn't have to say this, but any code, unless otherwise stated, is untested
In reply to Re^2: Sorting array
by dragonchild
in thread Sorting array
by Anonymous Monk
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |