Objective: Write an algorithm to Print All the Well Ordered Permutations of a Given String.
What is Well Ordered String: When all the alphabets in a string occur in the increasing order irrespective of Lower Case or Upper case.
This is yet another problem in which you we see the power of recursion.
"Sumit" - Not Well Ordered . 'u' occurred after 'S'. "Now" - Well Ordered. N<o<W.
- Get the input string.
- Find out all the permutations of a String.
- Before printing check if the permutation is well formed.
Given String - Interview [e, e, I, i, n, r, t, v, w] [e, e, i, I, n, r, t, v, w] [e, e, i, I, n, r, t, v, w] [e, e, I, i, n, r, t, v, w]