I'm trying to write a recursive method that will take as input a string and output all permutations of that string. It's been a LONG time since I've worked in Java, and for some reason I'm really stuck on this. I've basically got my base case down, which is if the string's length is 1, then output the string as is, but if it gets greater than one, I'm clueless! Does anyone have any advice?

Thanks in advance!