Re: Silly do - while question

[Ben Bacarisse]

Newbie <ne****@gmail.comwrites:

#include <stdio.h>
#include <string.h>

void Permute(char *Perm,
size_t n,
size_t unchanged)
{

<snip>

/*
All i want here is to continue with rotation above if the first
element of right array is same as that before the rotation takes
place.
I know this is really silly but i just cannot figure it out!
Please Help!!!
*/

The version you posted in comp.programming has the correct loop. Why
change it?

--
Ben.

[Newbie]

Ben Bacarisse wrote:

Newbie <ne****@gmail.comwrites:

>#include <stdio.h>
#include <string.h>

void Permute(char *Perm,
size_t n,
size_t unchanged)
{

<snip>

>/*
All i want here is to continue with rotation above if the first
element of right array is same as that before the rotation takes
place.
I know this is really silly but i just cannot figure it out!
Please Help!!!
*/

The version you posted in comp.programming has the correct loop. Why
change it?

I have figured out the algorithm after some effort but I don't want to
print duplicated elements in the string.

So an input like "aabcc" should produce only distinct permutations.

[Ben Bacarisse]

Newbie <ne****@gmail.comwrites:

Ben Bacarisse wrote:

>Newbie <ne****@gmail.comwrites:

>>#include <stdio.h>
#include <string.h>

void Permute(char *Perm,
size_t n,
size_t unchanged)
{

<snip>

>>/*
All i want here is to continue with rotation above if the first
element of right array is same as that before the rotation takes
place.
I know this is really silly but i just cannot figure it out!
Please Help!!!
*/

The version you posted in comp.programming has the correct loop. Why
change it?

I have figured out the algorithm after some effort but I don't want to
print duplicated elements in the string.

So an input like "aabcc" should produce only distinct permutations.

Ah, homework?

--
Ben.

[Newbie]

Ben Bacarisse wrote:

Newbie <ne****@gmail.comwrites:

>Ben Bacarisse wrote:

>>Newbie <ne****@gmail.comwrites:

#include <stdio.h>
#include <string.h>

....snip..

Ah, homework?

No . Writing a recursive solution is a lot easier(even an iterative
one). In fact i don't need the "rotation" method if duplicate elements
are not a concern.
i know its pretty silly but i just cannot figure it out at this point of
time.

for(outer = unchanged; outer < n; outer++)
{

/*Rotate the array to the right*/
do {
temp = Perm[outer];
for(inner = outer; inner unchanged; inner--){
Perm[inner] = Perm[inner - 1];
}
Perm[unchanged] = temp;

/*Done Rotation*/
}while( temp == Perm[unchanged]);

This is an infinite loop.I guess the while statement should be while (
temp == Perm [outer]).Tried increasing outer(keeping bounds in mind)
inside the do {} part as well but nothing will work when I really need
it to.

Anyways thanks for the reply.

[Richard Heathfield]

Newbie said:

Ben Bacarisse wrote:

<snip>

>Ah, homework?

No . Writing a recursive solution is a lot easier

Especially when someone else wrote it.

--
Richard Heathfield <http://www.cpax.org.uk>
Email: -http://www. +rjh@
Google users: <http://www.cpax.org.uk/prg/writings/googly.php>
"Usenet is a strange place" - dmr 29 July 1999

[Newbie]

Richard Heathfield wrote:

Newbie said:

>Ben Bacarisse wrote:

<snip>

>>Ah, homework?

No . Writing a recursive solution is a lot easier

Especially when someone else wrote it.

Yes sir. Its your Code. I never claimed it to be mine.

This is only half the solution I am trying to achieve.
If you can help me change this for duplicated strings,
it will suffice.But then it is a question more apt for
comp.lang.programming.Sigh !

void permute(char* v, const int start, const int n)
{
char tmp ;
int i;
int repeat = 0;

if (start == n-1) {
if (v != 0) {
for (i = 0; i < n; i++) {
printf("%c", v[i] );
}
printf("\n");
}
}
else {
for (i = start; i < n; i++) {
tmp = v[i];
v[i] = v[start];
v[start] = tmp;

permute(v, start+1, n);

v[start] = v[i];
v[i] = tmp;
}
}
}

Probably the question was too silly to be answered.
Thank You.