aboutsummaryrefslogtreecommitdiff
path: root/comparison/Haskell/isort-40000.hs
diff options
context:
space:
mode:
Diffstat (limited to 'comparison/Haskell/isort-40000.hs')
-rw-r--r--comparison/Haskell/isort-40000.hs36
1 files changed, 36 insertions, 0 deletions
diff --git a/comparison/Haskell/isort-40000.hs b/comparison/Haskell/isort-40000.hs
new file mode 100644
index 0000000..f834d00
--- /dev/null
+++ b/comparison/Haskell/isort-40000.hs
@@ -0,0 +1,36 @@
+{-
+(* http://www.codecodex.com/wiki/Insertion_sort#Standard_ML *)
+-}
+import System.Random
+
+isort [] = []
+isort (x:xs) = insert x (isort xs)
+
+insert x [] = [x]
+insert x (y:ys) =
+ if x<=y then x:y:ys
+ else y:(insert x ys)
+
+
+{-
+main = print $ isort [3,2,8,5]
+-}
+
+
+randomList :: Int -> IO([Int])
+randomList 0 = return []
+randomList n = do
+ r <- randomRIO (1,10000)
+ rs <- randomList (n-1)
+ return (r:rs)
+
+
+
+main = do
+ list <- randomList 40000
+ let sorted = isort list
+ print (take 10 sorted)
+
+
+
+