
Recursive Functions
I need some help with an assignment.
I've got most of it figured out, I just need to code a part where it tries every possible combination of numbers to see if it fits a certain pattern.
it needs to be able to handle any number of digits and to any depth.
e.g it would have to be able to handle trying all combinations of 1 to 4 for 6 digits.
I have thought about this problem alot and the only way I can think of solving it is by recursive functions. If anybody has had to solve a siimilar problem or can be of any help can you plesase post.
thanks

You can find all combinations with a recursive or a nonrecursive solution. Do a google search, you'll get plenty of hits with explanations, source code and libraries.