Re: Competition fuels obsession over Perl

Given a sentence, print out each word and the number of vowels it contains. Print them out in order by number of vowels and them alphabetical if same number of vowels.

Hmmm. Didn't we just see an SoPW node about that sort of problem a little while back? ;^)

Comment on Re: Competition fuels obsession over Perl

Replies are listed 'Best First'.
Re: Re: Competition fuels obsession over Perl by jonadab (Parson) on Feb 19, 2004 at 19:35 UTC
Didn't we just see an SoPW node about that sort of problem a little while back? Probably. There was probably also a JAPH posted based on this idea in the Obfuscated Code section recently. Either that or somebody was playing golf with it, trying to get it under 60 characters for a signature without messing up under scrictures and warnings. In other words, it's a textbook example of the sort of thing that's cosmically easy to do in Perl, because it's exactly the sort of thing Perl was designed to do easily. `;$;=sub{$/};@;=map{my($a,$b)=($_,$;);$;=sub{$a.$b->()}}` `split//,".rekcah lreP rehtona tsuJ";$\=$;[-1]->();print`	[reply]

Replies are listed 'Best First'.

Re: Re: Competition fuels obsession over Perl
by jonadab (Parson) on Feb 19, 2004 at 19:35 UTC

Didn't we just see an SoPW node about that sort of problem a little while back?

Probably. There was probably also a JAPH posted based on this idea in the Obfuscated Code section recently. Either that or somebody was playing golf with it, trying to get it under 60 characters for a signature without messing up under scrictures and warnings.

In other words, it's a textbook example of the sort of thing that's cosmically easy to do in Perl, because it's exactly the sort of thing Perl was designed to do easily.

;$;=sub{$/};@;=map{my($a,$b)=($_,$;);$;=sub{$a.$b->()}} split//,".rekcah lreP rehtona tsuJ";$\=$;[-1]->();print

[reply]