Re: (Golf) Kaprekar's Process

[larryk]

I make your original 79 chars.

sub a {

return$i if$_[0]==495;$a=join'',sort{$a<=>$b}split//,pop;$i++;a((rever
+se$a)-$a)
#23456789_123456789_123456789_123456789_123456789_123456789_123456789_
[phone]

}

if you are sorting single digits then perl's default alphanumeric sort will give the same result as explicitly defining a numeric sort. #71

update: just realised you can use $_ instead of $a. #69

"Argument is futile - you will be ignorralated!"

[srawls]

Humm, I just counted manually and you're right, it is 79. I wonder why this prints 60:

print length("return$i if$_[0]==495;$a=join'',sort{$a<=>$b}"
            ."split//,pop;$i++;a((reverse$a)-$a)");

Anyway, nice improvements, I should've caught that sort one : )

Update:Ooops, thanks MeowChow.

The 15 year old, freshman programmer,
Stephen Rawls

[MeowChow]

You're double-quoting the code, which means that the variables are getting interpolated into undef 0-length strings.

   MeowChow                                   
               s aamecha.s a..a\u$&owag.print

[mr.nick]

And I can take it down a litter further massaging your code into this:

sub g{ 
#          1         2         3         4         5         6        
+ 7  
# 12345678901234567890123456789012345678901234567890123456789012345678
+9012
  return$,if($_=pop)==495;$_=join'',sort split//,$_;$,++;g((reverse)-$
+_)
}

But I can't do one on my own... my own solution came in at 83 :(

mr.nick ...