Beefy Boxes and Bandwidth Generously Provided by pair Networks
Clear questions and runnable code
get the best and fastest answer

Re: Sorting Question

by allolex (Curate)
on Oct 04, 2004 at 19:08 UTC ( #396345=note: print w/ replies, xml ) Need Help??

in reply to Sorting Question

In addition to the lovely sorting advice found here, you might consider rewriting your code in a more perlish way. The C-style loops with counters are all right, but perl has while and for(each) loops that do the same thing, except better. ;)

Damon Allen Davison

Comment on Re: Sorting Question

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://396345]
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others examining the Monastery: (8)
As of 2015-07-30 09:28 GMT
Find Nodes?
    Voting Booth?

    The top three priorities of my open tasks are (in descending order of likelihood to be worked on) ...

    Results (270 votes), past polls