Design
aa0601.txt
Associated article: Synchronized Recursion
Tags: Design
Published source code accompanying the article by Shawn Bayern in which he presents strategies to adapt a generally memory-intensive recursive algorithm for use in environments where memory may be limited and reusability is required.
Algorithm Alley
by Shawn Bayern
Example 1:
void getBitCombinations(BitSet bs, int start, int current, int target)
{
if (current == target) {
// success, so store a copy of the BitSet in a Vector
v.add(bs.clone());
return;
}
if (start == a.length)
return; // ...
