-
Notifications
You must be signed in to change notification settings - Fork 22
/
anagram.c
49 lines (39 loc) · 980 Bytes
/
anagram.c
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
#include <stdio.h>
#include <string.h>
int main (void) {
char s1[] = "recitals";
char s2[] = "articles";
char temp;
int i, j;
int n = strlen(s1);
int n1 = strlen(s2);
// If both strings are of different length, then they are not anagrams
if( n != n1) {
printf("%s and %s are not anagrams! \n", s1, s2);
return 0;
}
// lets sort both strings first −
for (i = 0; i < n-1; i++) {
for (j = i+1; j < n; j++) {
if (s1[i] > s1[j]) {
temp = s1[i];
s1[i] = s1[j];
s1[j] = temp;
}
if (s2[i] > s2[j]) {
temp = s2[i];
s2[i] = s2[j];
s2[j] = temp;
}
}
}
// Compare both strings character by character
for(i = 0; i<n; i++) {
if(s1[i] != s2[i]) {
printf("Strings are not anagrams! \n", s1, s2);
return 0;
}
}
printf("Strings are anagrams! \n");
return 0;
}