added fisher yates random shuffle method without using IO monads

firephil · Mar 17, 2021 · 3f8ed5b · 3f8ed5b
1 parent f43e238
commit 3f8ed5b
Show file tree

Hide file tree

Showing 2 changed files with 5 additions and 3 deletions.
diff --git a/Haskell-Algorithms.cabal b/Haskell-Algorithms.cabal
@@ -38,7 +38,8 @@ executable Haskell-Algorithms
                       time >=1.1,
                       random >=0.1,
 					  array >= 0.5,
-					  MonadRandom >= 0.5
+					  MonadRandom >= 0.5,
+					  containers >= 0.1
 
     other-modules: Timer,
                    Mergesort,

diff --git a/app/Main.hs b/app/Main.hs
@@ -4,10 +4,11 @@ import Mergesort(mergeSort)
 import System.Random
 import Control.Monad.Random
 
-import ShuffleList(shuffle)
+import ShuffleList(shuffle,fisherYates )
 
-ls = [1..10000]
+ls = [1..8000]
 rev = reverse ls
+xs = fisherYates ls
 
 main :: IO ()
 main =  do