Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl-Sensitive Sunglasses

Re: Challenge: Another Infinite Lazy List

by kelan (Deacon)
on Mar 18, 2005 at 18:20 UTC ( #440766=note: print w/replies, xml ) Need Help??

in reply to Challenge: Another Infinite Lazy List

Here's my naive Haskell implementation, done without studying any of the others here, though after finishing and looking briefly through them, it is rather similar to some.

merge (x:xs) (y:ys) | x < y = x : merge xs (y:ys) | x > y = y : merge (x:xs) ys | x == y = x : merge xs ys supermerge (x:[]) = x supermerge (x:y:ys) = supermerge $ (merge x y) : ys multiples x = map (*x) [1..] multiplesFromList x = supermerge $ map (multiples) x limbic's_challenge = multiplesFromList [2,3,5]
I'm not sure how fast it is comparatively (especially since I'm running it in Hugs), but I can get a million items in about 20 seconds.

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://440766]
[choroba]: if you didn't know the precision, what output would you expect?

How do I use this? | Other CB clients
Other Users?
Others making s'mores by the fire in the courtyard of the Monastery: (11)
As of 2017-05-24 19:05 GMT
Find Nodes?
    Voting Booth?