added medium algo

Author: willdoescode

README.md

@@ -17,4 +17,6 @@
 
 #### Medium
 
+* Sort List
+
 #### Hard

haskell-things.cabal

@@ -14,7 +14,9 @@ cabal-version:       >=1.10
 extra-source-files:  README.md
 
 executable haskell-things
-  hs-source-dirs:      src, src/Easy
+  hs-source-dirs:      src
+                       , src/Easy
+                       , src/Medium
   main-is:             Main.hs
   default-language:    Haskell2010
   build-depends:       base >= 4.7 && < 5, containers
@@ -27,3 +29,4 @@ executable haskell-things
                        , SortArrayByParity
                        , ToLowerCase
                        , MinimumIndexSumofTwoLists
+                       , SortList

haskell-things.iml

@@ -5,6 +5,7 @@
     <content url="file://$MODULE_DIR$">
       <sourceFolder url="file://$MODULE_DIR$/src" isTestSource="false" />
       <sourceFolder url="file://$MODULE_DIR$/src/Easy" isTestSource="false" />
+      <sourceFolder url="file://$MODULE_DIR$/src/Medium" isTestSource="false" />
       <excludeFolder url="file://$MODULE_DIR$/.stack-work" />
     </content>
     <orderEntry type="inheritedJdk" />

src/Main.hs

@@ -9,32 +9,40 @@ import TargetArrayInGivenOrder
 import SortArrayByParity
 import ToLowerCase
 import MinimumIndexSumofTwoLists
+import SortList
 
 main :: IO ()
 main = do
   putStrLn "<-- FizzBuzz -->"
   putStrLn $ unlines $ fizzbuzz [1..100]
+
   putStrLn "<-- TwoSum -->"
   print $ twosum [4, 5, 2, 5] 7
+
   putStrLn "<-- Running Sum -->"
   print $ runningsum [1, 1, 1, 1, 1]
   print $ runningsum [1, 2, 3, 4]
+
   putStrLn "<-- Smaller Numbers Than Current -->"
   print $ smallerNumbersThanCurrent [8, 1, 2, 2, 3]
   print $ smallerNumbersThanCurrent [6, 5, 4, 8]
+
   putStrLn "<-- Num Of Steps to Reduce Num To Zero -->"
   print $ numOfStepsToReduceNumToZero 14
   print $ numOfStepsToReduceNumToZero 8
   print $ numOfStepsToReduceNumToZero 123
+
   putStrLn "<-- Target Array In Given Order -->"
   print $ targetArrayInGivenOrder [0, 1, 2, 3, 4] [0, 1, 2, 2, 1]
   print $ targetArrayInGivenOrder [1, 2, 3, 4, 0] [0, 1, 2, 3, 0]
+
   putStrLn "<-- Sort Array By Parity -->"
   print $ sortArrayByParity [3, 1, 2, 4]
   print $ sortArrayByParity [1, 2, 3, 4]
   putStrLn "<-- To Lower Case -->"
   putStrLn $ toLowerCase "Hello"
   putStrLn $ toLowerCase "LOVELY"
+
   putStrLn "<-- Minimum Index Sum of Two Lists -->"
   print $ minimumIndexSumofTwoLists ["Shogun","Tapioca Express","Burger King","KFC"]
    ["Piatti","The Grill at Torrey Pines","Hungry Hunter Steakhouse","Shogun"]
@@ -45,3 +53,6 @@ main = do
   print $ minimumIndexSumofTwoLists ["Shogun","Tapioca Express","Burger King","KFC"]
     ["KNN","KFC","Burger King","Tapioca Express","Shogun"]
 
+  putStrLn "<-- Sort List -->"
+  print $ sortList [9, 3, 4, 1]
+  print $ sortList ['c', 'a', 'f', 'y']

src/Medium/SortList.hs

@@ -0,0 +1,5 @@
+module SortList ( sortList ) where
+  
+sortList :: (Ord a) => [a] -> [a]
+sortList (x:xs) = sortList [y | y <- xs, y <= x] ++ [x] ++ sortList [y | y <- xs, y > x]
+sortList [] = []