I have implemented a Set datatype in Haskell using Binary search tree. I have not used any of the in-built functions nor imported any module. My set datatype is
I need to get all possible subsets of an array. Say I have this: [1, 2, 3] How do I get this? [], [1], [2], [3], [1, 2], [2, 3], [1, 3], [1, 2, 3] I am intere
Given a set {1,2,3,4,5...n} of n elements, we need to find all subsets of length k . For example, if n = 4 and k = 2, the output would be {1, 2}, {1, 3}, {1,