Differences

This shows you the differences between two versions of the page.

--- background [2022/04/23 14:46] – [Why is it still worth to use Haskell?] f2b216
+++ background [2025/10/08 00:44] (current) – external edit 127.0.0.1
@@ Line 93: / Line 93: @@
 )<sup>1</sup> The code may __**not**__ work with extrem large numbers. I do not know at which conditions the floor function would fail. My calculator says sqrt((1E16x1E16)-1) is 9.999.999.999.999.999,9999999999999999, but sqrt((1E17x1E17)-1) is (1E17)!
-The following code (sieve of Erastothenes) will also work but by far not as fast for large numbers (approximately 100 times slower for the first 20 thousand prime numbers)
+The following code (sieve of Erastothenes) will also work but by far not as fast for large numbers (approximately 100 times slower for the first 20 thousand prime numbers):
 <code Haskell>
 primes = let sieve (n0:lrn) = n0 : sieve [ n | n <- lrn, n `mod` n0 /= 0 ] in sieve [2..]