Beefy Boxes and Bandwidth Generously Provided by pair Networks
Welcome to the Monastery

Re^3: Hello Perl 6. Running pugs on Windows

by pernod (Chaplain)
on Feb 16, 2005 at 15:12 UTC ( #431604=note: print w/replies, xml ) Need Help??

in reply to Re^2: Hello Perl 6. Running pugs on Windows
in thread Hello Perl 6. Running pugs on Windows

Exactly, and to provide another example, this time in Haskell. The quicksort that serves as a model for the code in my original node:

qsort [] = [] qsort (x:xs) = qsort elts_lt_x ++ [x] ++ qsort elts_greq_x where elts_lt_x = [y | y <- xs, y < x] elts_greq_x = [y | y <- xs, y >= x]

I really like the short and concise way this expresses the quicksort algorithm in almost mathematical notation. Although math was never my strong point, this way of talking about sets and their behaviour is in my opinion very powerful. Take a look at this node for some examples that are a bit closer to home.

Mischief. Mayhem. Soap.

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others surveying the Monastery: (6)
As of 2019-08-19 21:26 GMT
Find Nodes?
    Voting Booth?
    If you were the first to set foot on the Moon, what would be your epigram?

    Results (141 votes). Check out past polls.