68 lines
1.3 KiB
C
68 lines
1.3 KiB
C
|
#include <stdio.h>
|
||
|
|
void print(const int *v, const int size)
|
||
|
|
{
|
||
|
|
int i;
|
||
|
|
if (v != 0)
|
||
|
|
{
|
||
|
|
for ( i = 0; i < size; i++)
|
||
|
|
{
|
||
|
|
printf("%4d", v[i] );
|
||
|
|
}
|
||
|
|
printf("\n");
|
||
|
|
}
|
||
|
|
}
|
||
|
|
void alexanderbogomolyn(int *Value, int N, int k)
|
||
|
|
{
|
||
|
|
static level = -1;
|
||
|
|
int i;
|
||
|
|
level = level+1;
|
||
|
|
Value[k] = level;
|
||
|
|
if (level == N)
|
||
|
|
print(Value, N);
|
||
|
|
else
|
||
|
|
for (i = 0; i < N; i++)
|
||
|
|
if (Value[i] == 0)
|
||
|
|
alexanderbogomolyn(Value, N, i);
|
||
|
|
level = level-1;
|
||
|
|
Value[k] = 0;
|
||
|
|
}
|
||
|
|
int main()
|
||
|
|
{
|
||
|
|
int N = 4;
|
||
|
|
int i;
|
||
|
|
int Value[N];
|
||
|
|
for (i = 0; i < N; i++)
|
||
|
|
{
|
||
|
|
Value[i] = 0;
|
||
|
|
}
|
||
|
|
printf("\nPermutation using Alexander Bogomolyn's algorithm: ");
|
||
|
|
alexanderbogomolyn(Value, N, 0);
|
||
|
|
return 0;
|
||
|
|
}
|
||
|
|
|
||
|
|
/*
|
||
|
|
Permutation using Alexander Bogomolyns algorithm:
|
||
|
|
1 2 3 4
|
||
|
|
1 2 4 3
|
||
|
|
1 3 2 4
|
||
|
|
1 4 2 3
|
||
|
|
1 3 4 2
|
||
|
|
1 4 3 2
|
||
|
|
2 1 3 4
|
||
|
|
2 1 4 3
|
||
|
|
3 1 2 4
|
||
|
|
4 1 2 3
|
||
|
|
3 1 4 2
|
||
|
|
4 1 3 2
|
||
|
|
2 3 1 4
|
||
|
|
2 4 1 3
|
||
|
|
3 2 1 4
|
||
|
|
4 2 1 3
|
||
|
|
3 4 1 2
|
||
|
|
4 3 1 2
|
||
|
|
2 3 4 1
|
||
|
|
2 4 3 1
|
||
|
|
3 2 4 1
|
||
|
|
4 2 3 1
|
||
|
|
3 4 2 1
|
||
|
|
4 3 2 1
|