Beefy Boxes and Bandwidth Generously Provided by pair Networks
laziness, impatience, and hubris
 
PerlMonks  

Re: Sorting issues

by zeidrik (Scribe)
on May 28, 2001 at 15:08 UTC ( #83717=note: print w/ replies, xml ) Need Help??


in reply to Sorting issues

If You insist on "sort" here is my way to do it:
for the database as

1 2 3 |10 a b c |20 e f g |100 x n f |1
the code
#!/usr/bin/perl -w use strict; my %H; open(R,"database"); map {/\|(\d+)/; $H{$1}=$_ if $1}<R>; close(R); foreach (sort {$a<=>$b} keys %H){print $H{$_}}
does exactly:
x n f |1 1 2 3 |10 a b c |20 e f g |100
Enjoy...


Comment on Re: Sorting issues
Select or Download Code

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others browsing the Monastery: (4)
As of 2015-07-04 21:56 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

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









    Results (60 votes), past polls