subset :: [Int] -> [Int] -> Bool
-- testing 44 combinations of argument values
-- pruning with 29/39 rules
-- 2 candidates of size 1
-- 0 candidates of size 2
-- 0 candidates of size 3
-- 0 candidates of size 4
-- 13 candidates of size 5
-- 0 candidates of size 6
-- 6 candidates of size 7
-- 176 candidates of size 8
-- tested 48 candidates
subset [] xs  =  True
subset (x:xs) ys  =  elem x ys && subset xs ys

subset :: [Int] -> [Int] -> Bool
-- testing 44 combinations of argument values
-- pruning with 3/3 rules
-- 1 candidates of size 1
-- 0 candidates of size 2
-- 2 candidates of size 3
-- 6 candidates of size 4
-- 2 candidates of size 5
-- tested 10 candidates
subset xs ys  =  sort xs `isSubsequenceOf` sort ys

