if the string is like abcdef
then they will be numbered like 012345 and now we represent them in base 5
numbering and also in sorted order
the next permutation is
012354
012435
012453
012534
012543
013245
and so on..
On Sat, Oct 1, 2011 at 4:11 PM, rahul sharma rahul23111...@gmail.comwrote:
i have searched the archives.any give me algorithm with example...it
would be great help..thnx in advance
On Sun, Oct 2, 2011 at 2:57 AM, Prakash D cegprak...@gmail.com wrote:
if the string is like abcdef
then they will be numbered like 012345 and now we represent them in base 5
numbering
i have searched the archives.any give me algorithm with
example...it would be great help..thnx in advance
#include iostream
#include string
#include stdio.h
using namespace std;
void
permute(string inp, string oth)
{
if ( inp == ) {
coutothendl;
