aboutsummaryrefslogtreecommitdiff
path: root/comparison/Haskell/qsort-800000.hs
diff options
context:
space:
mode:
Diffstat (limited to 'comparison/Haskell/qsort-800000.hs')
-rw-r--r--comparison/Haskell/qsort-800000.hs37
1 files changed, 37 insertions, 0 deletions
diff --git a/comparison/Haskell/qsort-800000.hs b/comparison/Haskell/qsort-800000.hs
new file mode 100644
index 0000000..492efef
--- /dev/null
+++ b/comparison/Haskell/qsort-800000.hs
@@ -0,0 +1,37 @@
+{-
+(* http://www.codecodex.com/wiki/Insertion_sort#Standard_ML *)
+-}
+import System.Random
+
+
+qsort [] = []
+qsort [x] = [x]
+qsort (x:xs) = (qsort left) ++ [x] ++ (qsort right)
+ where (left, right) = part x xs
+
+part pivot [] = ([], [])
+part pivot (x:xs)
+ | x<pivot = (x:below, above)
+ | otherwise = (below, x:above)
+ where
+ (below, above) = part pivot xs
+
+
+{-
+main = print $ qsort [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 800000
+ let sorted = qsort list
+ print (take 10 sorted)
+