More formally, if all the permutations of the array are sorted in one container according to their lexicographical order, then the next permutation of that array is the permutation that follows it in ...

Kth Permutation Sequence (Optional) Given a string of length n containing lowercase alphabets only. You have to find the k-th permutation of string lexicographically. $\dfrac {k} { (n-1)!}$ will give ...