Combinatorial abstraction. Using binary strings from 0-2^(n-1) to represent the subsets of a set of size n.

What it does

finds the subsets of a set

How I built it

html5, css3, and javascript.

Challenges I ran into

Javascript proved to be a difficult language for me as someone who comes from working with mainly high level programming languages such as python or Ruby.

Accomplishments that I'm proud of

Firstly, the app works. Overall, I would say that I am most proud that I was able to build a basic web app with the little I know.

What I learned

The language of Javascript, encorporating it efficiently in html5

What's next for PowerSetter

improvements to the overall UI, styling, and fixing some serious bugs such passing in sets as elements.

Built With

Share this project: