Experimental collection
Advanced Algorithms
Interactive explorations of computational complexity and optimization. The collection currently contains one working demonstration; no placeholder projects are advertised as available.
Partition problem
Compare exactness, speed, and balance.
Given a multiset of positive integers, divide it into two subsets whose sums are as close as possible.
Open playgroundImplemented approaches
Exponential subset enumeration to determine whether an equal partition exists.
Largest-processing-time heuristic for a fast approximate balance.
Exhaustive optimization for the smallest difference, with progress and cancellation behavior.
Scope
What the demonstration teaches
The playground makes exponential workload growth visible and contrasts decision, exact optimization, and heuristic results on the same input.
It is an educational browser demonstration. It does not claim a new algorithm, novel complexity result, or benchmark contribution.