Added bubble, quick, selection, merge, gnome sorting algorithms

1 files changed, 19 insertions, 0 deletions

diff --git a/mergesort.hs b/mergesort.hs
new file mode 100644
index 0000000..5c140b3
--- /dev/null
+++ b/mergesort.hs
@@ -0,0 +1,19 @@
+
+
+
+mergeSort :: Ord a => [a] -> [a]
+mergeSort x | length x <= 1 = x
+mergeSort x =
+    let n = (length x) `div` 2
+        left = mergeSort (take n x)
+        right = mergeSort (drop n x)
+    in merge left right
+
+
+
+merge :: Ord a => [a] -> [a] -> [a]
+merge [] y = y
+merge x [] = x
+merge (x:xs) (y:ys) = if x <= y then x:(merge xs (y:ys)) else y:(merge (x:xs) ys)
+
+