-
Notifications
You must be signed in to change notification settings - Fork 0
/
permutations.cpp
96 lines (90 loc) · 1.43 KB
/
permutations.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
/* Min Rank of a given number: Given an unsigned number as input, find the index of the number (index starts from 0)
in all permutations of the number, sorted in ascending order.
input 213: output 2 (as 123, 132, 213, 231, 312, 321 are the permutations and 2 is the index values of 213)*/
#include<stdio.h>
#include<conio.h>
int permutations(int);
void dotest();
int checkoutput( int, int);
struct test
{
int num;
int outputindex;
}
testcases[5]=
{
{231,2},
{451,4},
{563,5},
{678,7},
{234,5}
};
void main()
{
dotest();
getch();
}
void dotest()
{
int i,index;
for(i=0;i<5;i++)
{
index=permutations(testcases[i].num);
checkoutput( index,testcases[i].outputindex);
}
}
int permutations( int n)
{
int arr[10],i=0,t,j,finalvalue,temp,k,l,sum=1;
int per;
while(n!=0)
{
t=n%10;
n=n/10;
arr[i]=t;
i++;
}
finalvalue=arr[i-1];
per=i*(i-1);
for(j=0;j<i;j++)
{
for(k=j+1;k<i;k++)
{
if(arr[j]>arr[k])
{ temp=arr[j];
arr[j]=arr[k];
arr[k]=temp;
}
}
}
for(k=0;k<i;k++)
{
printf("%d",arr[k]);
for(l=0;l<i;l++)
{
if(arr[l]==arr[k])
continue;
else
printf("%d",arr[l]);
}
printf("\t");
printf("%d",arr[k]);
for(l=i-1;l>=0;l--)
{
if(arr[l]==arr[k])
continue;
else
printf("%d",arr[l]);
}
printf("\t");
}
return finalvalue;
}
int checkoutput(int a, int b)
{
if(a==b)
printf("\nValid\n");
else
printf("\nInvalid\n");
return 0;
}