Beefy Boxes and Bandwidth Generously Provided by pair Networks
We don't bite newbies here... much
 
PerlMonks  

Re: Sorting challenge

by jeffa (Bishop)
on Jul 22, 2013 at 21:35 UTC ( #1045733=note: print w/replies, xml ) Need Help??


in reply to Sorting challenge

Don't expect the user input to contain your exit condition. Instead, accept all user input (until EOF which terminates the program) and then filter the results.

chomp( my @input = <STDIN> ); for (sort { $a <=> $b } @input) { next if /\D/; last if $_ > 1_000_000; print "$_\n"; }


jeffa

L-LL-L--L-LL-L--L-LL-L--
-R--R-RR-R--R-RR-R--R-RR
B--B--B--B--B--B--B--B--
H---H---H---H---H---H---
(the triplet paradiddle with high-hat)

Replies are listed 'Best First'.
Re^2: Sorting challenge
by PerlSufi (Friar) on Jul 22, 2013 at 21:40 UTC
    Thanks, jeffa. Good call. I'll try this out when I can

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://1045733]
help
Chatterbox?
and all is quiet...

How do I use this? | Other CB clients
Other Users?
Others wandering the Monastery: (7)
As of 2017-07-21 20:50 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    I came, I saw, I ...
























    Results (335 votes). Check out past polls.