-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathstringPermutation.c
More file actions
108 lines (93 loc) · 1.94 KB
/
stringPermutation.c
File metadata and controls
108 lines (93 loc) · 1.94 KB
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
97
98
99
100
101
102
103
104
105
106
107
108
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define LEN 20
void mergeArray(char str[], int s1, int e1, int s2, int e2) {
char *mergeStr;
int i, j, k = 0;
mergeStr = (char *)malloc((e1 - s1 + 1) + (e2 - s2 + 1));
for (i = s1, j = s2; i <= e1 && j <= e2;) {
if (str[i] < str[j]) {
mergeStr[k] = str[i];
i++;
k++;
} else {
mergeStr[k] = str[j];
j++;
k++;
}
}
while (i <= e1) {
mergeStr[k] = str[i];
i++;
k++;
}
while (j <= e2) {
mergeStr[k] = str[j];
j++;
k++;
}
mergeStr[k] = '\0';
for (i = 0; mergeStr[i] != '\0'; i++) {
str[s1 + i] = mergeStr[i];
}
free(mergeStr);
}
void mergeSort(char str[], int start, int end) {
int mid;
if (end == start) {
return;
}
mid = (start + end)/2;
mergeSort(str, start, mid);
mergeSort(str, mid+1, end);
mergeArray(str, start, mid, mid+1, end);
}
void swapChar(char str[], int i, int j) {
char tmp;
tmp = str[i];
str[i] = str[j];
str[j] = tmp;
}
void stringPermutations(char str[], int len, int cur, int firstWordFlag) {
int i;
if (cur == len - 1) {
if(firstWordFlag == len - 1) {
printf("%s", str);
return;
}
printf(",%s", str);
}
for (i = cur; i < len; i++) {
swapChar(str, i, cur);
if (i == cur) {
stringPermutations(str, len, cur+1, firstWordFlag + 1);
} else {
stringPermutations(str, len, cur+1, firstWordFlag);
}
swapChar(str, i, cur);
while (str[i+1] == str[i] && i < len) {
i++;
}
}
}
int main(int argc, char *argv[]) {
FILE *fp;
char str[LEN];
int len;
if (argc != 2) {
printf("Unsupported number of parameters passed. Exiting\n");
return 1;
}
fp = fopen(argv[1], "r");
fscanf(fp, "%s", str);
while (!feof(fp)) {
len = strlen(str);
mergeSort(str, 0, len - 1);
stringPermutations(str, len, 0, 0);
printf("\n");
fscanf(fp, "%s", str);
}
fclose(fp);
return 0;
}