aboutsummaryrefslogtreecommitdiff
path: root/comparison/Haskell
diff options
context:
space:
mode:
Diffstat (limited to '')
-rw-r--r--comparison/Haskell/ack3-11.hs3
-rw-r--r--comparison/Haskell/bsort-40000.hs2
-rw-r--r--comparison/Haskell/fib38.hs3
-rw-r--r--comparison/Haskell/isort-40000.hs7
-rw-r--r--comparison/Haskell/qsort-800000.hs4
5 files changed, 1 insertions, 18 deletions
diff --git a/comparison/Haskell/ack3-11.hs b/comparison/Haskell/ack3-11.hs
index 7c8f350..45b2853 100644
--- a/comparison/Haskell/ack3-11.hs
+++ b/comparison/Haskell/ack3-11.hs
@@ -4,6 +4,3 @@ ack m n = ack (m-1) (ack m (n-1))
main = print $ (ack 3 11)
-
-
-
diff --git a/comparison/Haskell/bsort-40000.hs b/comparison/Haskell/bsort-40000.hs
index 1940917..401ceaf 100644
--- a/comparison/Haskell/bsort-40000.hs
+++ b/comparison/Haskell/bsort-40000.hs
@@ -22,7 +22,6 @@ main = print $ bsort [3,2,8,5]
-}
-
randomList :: Int -> IO([Int])
randomList 0 = return []
randomList n = do
@@ -31,7 +30,6 @@ randomList n = do
return (r:rs)
-
main = do
list <- randomList 40000
let sorted = bsort list
diff --git a/comparison/Haskell/fib38.hs b/comparison/Haskell/fib38.hs
index 96040eb..658d228 100644
--- a/comparison/Haskell/fib38.hs
+++ b/comparison/Haskell/fib38.hs
@@ -4,6 +4,3 @@ fib n = fib (n - 2) + fib (n - 1)
main = print $ fib 38
-
-
-
diff --git a/comparison/Haskell/isort-40000.hs b/comparison/Haskell/isort-40000.hs
index f834d00..1abc148 100644
--- a/comparison/Haskell/isort-40000.hs
+++ b/comparison/Haskell/isort-40000.hs
@@ -1,5 +1,5 @@
{-
-(* http://www.codecodex.com/wiki/Insertion_sort#Standard_ML *)
+http://www.codecodex.com/wiki/Insertion_sort#Standard_ML
-}
import System.Random
@@ -25,12 +25,7 @@ randomList n = do
return (r:rs)
-
main = do
list <- randomList 40000
let sorted = isort list
print (take 10 sorted)
-
-
-
-
diff --git a/comparison/Haskell/qsort-800000.hs b/comparison/Haskell/qsort-800000.hs
index 492efef..2a9d60d 100644
--- a/comparison/Haskell/qsort-800000.hs
+++ b/comparison/Haskell/qsort-800000.hs
@@ -3,7 +3,6 @@
-}
import System.Random
-
qsort [] = []
qsort [x] = [x]
qsort (x:xs) = (qsort left) ++ [x] ++ (qsort right)
@@ -16,7 +15,6 @@ part pivot (x:xs)
where
(below, above) = part pivot xs
-
{-
main = print $ qsort [3,2,8,5]
-}
@@ -29,9 +27,7 @@ randomList n = do
return (r:rs)
-
main = do
list <- randomList 800000
let sorted = qsort list
print (take 10 sorted)
-