Jump to content

Stern-Brocot sequence: Difference between revisions

m
→‎{{header|Haskell}}: Applied Ormolu
m (→‎{{header|Haskell}}: Tidied iterate version.)
m (→‎{{header|Haskell}}: Applied Ormolu)
Line 2,420:
sb = 1 : 1 : f (tail sb) sb
where
f (a : aa) (b : bb) = a + b : a : f aa bb
 
main :: IO ()
Line 2,427:
print
[ (i, 1 + (\(Just i) -> i) (elemIndex i sb))
| i <- [1 .. 10] ++<> [100] ]
]
print $ all (\(a, b) -> 1 == gcd a b) $ take 1000 $ zip sb (tail sb)</lang>
print $
all (\(a, b) -> 1 == gcd a b) $
print $ all (\(a, b) -> 1 == gcd a b) $ take 1000 $ zip sb (tail sb)</lang>
{{out}}
<pre>[1,1,2,1,3,2,3,1,4,3,5,2,5,3,4]
9,659

edits

Cookies help us deliver our services. By using our services, you agree to our use of cookies.