Beefy Boxes and Bandwidth Generously Provided by pair Networks
Keep It Simple, Stupid
 
PerlMonks  

Re: Sorting - lower to upper

by shemp (Deacon)
on Jul 15, 2004 at 15:54 UTC ( [id://374698]=note: print w/replies, xml ) Need Help??


in reply to Sorting - lower to upper

Heres a not very tight implementation, but it should make clear whats going on:
{ my %hash = ( 'Ask' => 1, 'Bob' => 1, 'Cat' => 1, 'amy' => 1, 'ben' => 1, 'can' => 1, ); print join "\n", sort case_sorter keys %hash; } sub case_sorter { my $first_a = substr $a, 0, 1; my $first_b = substr $b, 0, 1; if ( ($first_a eq uc($first_a)) && ($first_b eq uc($first_b)) ) { return $a cmp $b; } elsif ( $first_a eq uc($first_a) ) { return 1; } elsif ( $first_b eq uc($first_b) ) { return -1; } else { return $a cmp $b; } }

Log In?
Username:
Password:

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

How do I use this?Last hourOther CB clients
Other Users?
Others chanting in the Monastery: (4)
As of 2024-04-25 23:16 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found