SinTan1729/99-haskell-problems
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity

chg: Only import the required functions

Browse source
This commit is contained in:
Sayantan Santra 2024-05-26 00:36:26 -05:00
parent a45b84ee9c
commit 01eeffd2a4
Signed by: SinTan1729
GPG key ID: EB3E68BFBA25C85F
5 changed files with 8 additions and 8 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

4
Problems 21-28/problem_23.hs
View file

@ -1,5 +1,5 @@
import Data.List
import System.Random
import Data.List (nub)
import System.Random (getStdGen, randomRs)
rndSelect :: [a] -> Int -> IO [a]
rndSelect ls n = do

4
Problems 21-28/problem_24.hs
View file

@ -1,5 +1,5 @@
import Data.List
import System.Random
import Data.List (nub)
import System.Random (getStdGen, randomRs)
diffSelect :: Int -> Int -> IO [Int]
diffSelect n m = do

4
Problems 21-28/problem_25.hs
View file

@ -1,5 +1,5 @@
import Data.List
import System.Random
import Data.List (nub)
import System.Random (getStdGen, randomRs)
rndPermu :: [a] -> IO [a]
rndPermu ls = do

2
Problems 21-28/problem_27.hs
View file

@ -1,4 +1,4 @@
import Data.List
import Data.List (groupBy, nub, permutations, sortBy)
group' :: [Int] -> [a] -> [[[a]]]
group' ln ls = map ((([([fst] <*>)] <*>) . groupBy grouper . sortBy sorter) . zip ls) (nub (permutations placers))

2
Problems 21-28/problem_28.hs
View file

@ -1,4 +1,4 @@
import Data.List
import Data.List (sortBy)
lsort :: [[a]] -> [[a]]
lsort = sortBy (\x y -> length x `compare` length y)