Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl: the Markov chain saw

Re: One for the weekend: challenge

by Anonymous Monk
on May 31, 2008 at 00:31 UTC ( #689368=note: print w/replies, xml ) Need Help??

in reply to One for the weekend: challenge

The deck is pretty-well “stacked” in favor of LISP on this one:   the nature of the problem lends itself particularly well to recursive solution and to so-called “pragmatic programming” (a LISP specialty in which programs build lists and then execute those lists).

I generally don't think that it's too useful to compare “language to language” without first giving very careful consideration to what it is that you are trying to do. Languages are tools... nothing more. You need to evaluate a great many non-computer factors when deciding what language(s) to deploy against a particular business task.

Replies are listed 'Best First'.
Re^2: One for the weekend: challenge
by BrowserUk (Pope) on May 31, 2008 at 01:06 UTC

    You might be surprised! But, I didn't post it for that reason.

    It's purely an exercise in seeing how people approach the problem in Perl, and then attempting to come up with some measure of "goodness" for those approaches.

    Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.
    "Science is about questioning the status quo. Questioning authority".
    In the absence of evidence, opinion is indistinguishable from prejudice.

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others avoiding work at the Monastery: (12)
As of 2018-10-15 13:50 GMT
Find Nodes?
    Voting Booth?
    When I need money for a bigger acquisition, I usually ...

    Results (82 votes). Check out past polls.