/prog/ challenge

The challenge is to produce an algorithm to solve the Subset-Sum Problem in your language of choice.  To make it somewhat interesting try to make it as efficient as possible and do not copy an existing algorithm but come up with one yourself.

Bonus Points:  Make the algorithm run in polynomial time.

>>25
the most beautiful thing about subset Sum problem is the inherent symmetry in everything.  As you approach it with different methods and representations they all seamlessly blend into each other.  It is almost like a million different ways to solve it in the same exact way.