Simple haskell task

Closed Posted 3 years ago Paid on delivery

$10-30 USD

Paid on delivery

Closed Paid on delivery

Write a Haskell program that generates the list of all the subsets of the set [1..n] that have as many elements as their complements. Note: the complement of a set contains all the elements in [1..n] that are not members of the given set. Show the outputs for n=6.

Prolog Java Lisp C Programming Haskell

Project ID: #27942085

About the project

2 proposals Remote project Active 3 years ago

Looking to make some money?

Benefits of bidding on Freelancer

Set your budget and timeframe
Get paid for your work
Outline your proposal
It's free to sign up and bid on jobs
Post a project like this