@clintmulligan/subset-sum-finder
The Fastest and Smallest Subset finder. Finds all subsets from an array that equal a target number. In O(N log N) time and 2N+2 Space.
1.0.3 • Published 5 years ago
Traveling sales man Packages
@armirage/subset-sum-solver
The Fastest and Smallest Subset finder. Finds all subsets from an array that equal a target number. In O(N log N) time and 2N+2 Space.