Beefy Boxes and Bandwidth Generously Provided by pair Networks
Problems? Is your data what you think it is?
 
PerlMonks  

Re (tilly) 3: (Golf) Strings-to-Array

by tilly (Archbishop)
on Mar 30, 2001 at 18:09 UTC ( #68364=note: print w/ replies, xml ) Need Help??


in reply to Re: Re (tilly) 1: (Golf) Strings-to-Array
in thread (Golf) Strings-to-Array

Please don't produce this kind of code except in fun.

But since you ask, the trick is recursion. Here it is broken out:

sub r { my $s; $s .= chop for @_ = @_; $s . 0 ? ( &r , $s ) : () }
and now with better variable names, fewer implicit variables, rewritten loops, that kind of thing:
sub recursive_s2a { my $str_last; foreach my $str (@_ = @_) { $str_last .= chop($str); } if ($str_last . 0) { return (recursive_s2a(@_) , $str_last ); } else { return; } }
And now you see that the function creates the last string in the list to produce, tests whether that was the empty string, if it was it returns nothing, if it wasn't it then proceeds by recursion to generate the first strings, and adds the string it produced to that list.

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others rifling through the Monastery: (3)
As of 2016-06-29 23:39 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    My preferred method of making French fries (chips) is in a ...











    Results (388 votes). Check out past polls.