**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.

http://www.careercup.com/question?id=6206517812396032

**Example :**

"Sumit" - Not Well Ordered . 'u' occurred after 'S'.
"Now" - Well Ordered. N<o<W.

**Approach:**

**Code:**

**Output**:

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]

__________________________________________________

**Top Companies Interview Questions..-**

If you find anything incorrect or you feel that there is any better approach to solve the above problem, please write comment.

__________________________________________________

### Like this:

Like Loading...

*Related*