title: Permutations, Recursion
body: <p>I have an assignment: User enters a String, example ABCD and the program has to give out alll the permutations.
  I don't want the whole code just a tip. this is what i got so far in thery i got nothing implemented.</p>
  
  <p>Taking ABCD as an example:</p>
  
  <p>get factorial of length of String in this case 4! = 24.</p>
  
  <p>24/4 = 6 So first letter has to change after 6. so far so good.</p>
  
  <p>than get factorial of remaining letters which are three 3! = 6.</p>
  
  <p>6/3 =2 2 places for each letter. from here i don't know how it can continue to fill 24 places.</p>
  
  <p>With this algorithm all i will have is</p>
  
  <p>ABCD</p>
  
  <p>ABD</p>
  
  <p>AC</p>
  
  <p>AC</p>
  
  <p>AD</p>
  
  <p>AD</p>
  
  <p>B</p>
  
  <p>B</p>
  
  <p>B</p>
  
  <p>B</p>
  
  <p>B</p>
  
  <p>B</p>
  
  <p>.</p>
  
  <p>. (continues with 6 C's and 6 D's)</p>
  
  <p>I think my problem is i do not have alot of experience with recursive problems so who can suggest some programs to program to help me get to know recursion better please do.</p>
  
  <p>Thanks! If somethings aren't clear please point out.</p>