@clintmulligan/subset-sum-finder (npm): 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.
Keywords: armirage|subset sum problem|subset|ssp|traveling sales man|knapsack|armirage-oss|knapsack-problem|recursive-algorithm|subset-sum|subset-sum-solver|travelling-salesman-problem|tree