Splits haskell function This is my combinations function I have already combinat

Question

Splits haskell function

This is my combinations function I have already

combinations :: Int -> [a] -> [[a]]
combinations 0 _ = [[]]
combinations _ [] = []
combinations n (x:xs) = (map (x:) (combinations (n-1) xs)) ++ (combinations n xs)

any help would be great

Recall that the function combinations takes a list ofelements of typeclass Ord and an integer k as its arguments and returns a list of (R) length k lists representing all possible subsets of size k. The function splits is similar, except that, given a list of elements of length n, it returns a list of pairs of lists. The first component of the pair represents a combination of length k. The second component represents the complementary combination of length n-k. Two combinations are complementary when their union is equal to the original list. For example, Main :t splits splits (Ord a) [a] (Cal, Cal) Mains splits abc ("c", "ab"), ("b", "ac"), ("bc", "a"), ("a", "bec"), ("ac", "b"), ("ab c")

Explanation / Answer

import Data.Ord (comparing)

wds :: [String]
wds = ["ABC", "EF", "GHIJ", "K"]

main :: IO ()
main = print $ argim (comparing length) wds

argim
:: Foldable t
=> (a -> a -> Ordering) -> t a -> a
argim cmp =
let min_ x y =
case cmp x y of
LT -> x
_ -> y
in foldr1 min_

Related Questions

Navigate

• Browse (All)
• Browse S
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.