Hi,<BR><BR>I'm currently coding a function in Java that will find the number of possible combinations for a string. I've run into a problem in to a problem with regards to both speed and memory usage.

This is probably a basic CS question.... but I was an MIS major... OH THE IRONY! Anyway, let's say that for no good reason I want to count to 10 and spit out the results. I could use recursion as in ...