int main (int argc, char const *argv[])
{
char str1[] = "george bush";
char str2[] = "he bugs gore";
printf("%d\n", is_anagram(str1, str2));
return 0;
}
int main(int argc, char* argv[])
{
if ( argc < 3 )
return 1;
int r = is_anagram(argv[1], argv[2]);
printf("%d\n",r);
return 0;
}
int main(void)
{
char * src = "abcd";
char * ptn = "dca";
printf("%d\n",is_anagram(src,ptn));
return 0;
}
char *empty_str()
{
char a[] = "";
char b[] = "";
mu_assert(1 == is_anagram(a, sizeof(a) - 1,
b, sizeof(b) - 1),
"Failed with empty string");
return NULL;
}
int main(void) {
int a [] = {1,2,3,4,5};
int b [] = {5,4,3,2,1};
int c [] = {3,5,4,2,1};
printArray(a, 5);
if (non_decreasing(a, 5)) {
printf("not ");
}
printf("decreasing\n");
printArray(b, 5);
if (non_decreasing(b, 5)) {
printf("not ");
}
printf("decreasing\n");
printArray(c, 5);
if (non_decreasing(c, 5)) {
printf("not ");
}
printf("decreasing\n");
char * name1 = "Fiona";
char * name2 = "Lin";
char * name = insert_string(name1, name2, 5);
printf("name(name1+name2)->%s\n", name);
name = insert_string(name1, name2, -1);
printf("name(name2+name1)->%s\n", name);
char * n = insert_string(name1, name2, 2);
printf("name(name2->name1)->%s\n", name);
printf("%s and %s ", name, n);
if (!is_anagram(name, n)) {
printf("not ");
}
printf("is anagram.\n");
printf("%s and %s ", name, name1);
if (!is_anagram(name, name1)) {
printf("not ");
}
printf("is anagram.\n");
return 0;
}
char *anagram()
{
char a[] = "unnoticed";
char b[] = "continued";
mu_assert(1 == is_anagram(a, sizeof(a) - 1,
b, sizeof(b) - 1),
"Failed with anagram");
return NULL;
}
char *str_len_1()
{
char a[] = "a";
char b[] = "a";
mu_assert(1 == is_anagram(a, sizeof(a) - 1,
b, sizeof(b) - 1),
"Failed with str len 1");
return NULL;
}
char *not_anagram()
{
char a[] = "unnoticed";
char b[] = "ravenholm";
mu_assert(0 == is_anagram(a, sizeof(a) - 1,
b, sizeof(b) - 1),
"Failed with str that is not an anagram");
return NULL;
}
void main ()
{
char *str1 = "Testffff";
char *str2 = "tseT";
if (is_anagram(str1, str2))
printf ("\nAnagram\n");
else
printf ("\nNo\n");
char test1 = 'c';
char test2 = 'd';
printf ("\n%d\n", (test1^test2));
}
int main(int argc, char **argv)
{
if (argc != 3)
return (-1);
else
{
if (is_anagram(argv[1], argv[2]))
{
fprintf(stdout, "they are anagrams\n");
return (0);
}
fprintf(stdout, "they are NOT anagrams\n");
}
return (0);
}
int
main(int argc,
char **argv)
{
char s1[100];
char s2[100];
printf("Enter string 1: ");
fgets(s1, 100, stdin);
printf("Enter string 2: ");
fgets(s2, 100, stdin);
if (is_anagram(s1, s2)) {
printf("s1 and s2 are anagrams\n");
} else {
printf("s1 and s2 are not anagrams\n");
}
return 0;
}
int main(void) {
const char *tests[][2] = {
{"123", "321"},
{"111", "123"},
{NULL, NULL}
};
int i = 0;
while (tests[i][0]) {
if (is_anagram(tests[i][0], tests[i][1]))
printf("%s is an anagram of %s\n", tests[i][0], tests[i][1]);
else
printf("%s is not an anagram of %s\n", tests[i][0], tests[i][1]);
i++;
}
return 0;
}
int main(){
char s1[101000],s2[101000];
printf("Enter str1: ");
fgets(s1,101000,stdin);
printf("Enter str2: ");
fgets(s2,101000,stdin);
int i,l1,l2;
l1=strlen(s1);
l2=strlen(s2);
for(i=0;i<l1-1 && i<l2-1;i++){
if(((s1[i]>122) || (s1[i]<97)) && (s1[i]!=' ')){
printf("Invalid strings...\nExpected input consists of only lower case letters\n");
return 0;
}
if (((s2[i]>122) || (s2[i]<97)) && (s2[i]!=' ')){
printf("Invalid strings...\nExpected input consists of only lower case letters\n");
return 0;
}
}
is_anagram(s1,s2);
return 0;
}
void anagram_scan()
{
int i;
for(i=2;refined_hash_tab[i]!=NULL && i<30;i++)
{
while(refined_hash_tab[i]!=NULL)
{
struct object *pre = refined_hash_tab[i],*obj = refined_hash_tab[i]->next;
while(obj!=NULL)
{
if(is_anagram(pre->str,obj->str))
{
if(pre->flag!=2)
{
printf(" %s",pre->str);
pre->flag = 2;
}
if(obj->flag!=2)
{
printf(" %s",obj->str);
obj->flag = 2;
}
}
obj = obj->next;
}
refined_hash_tab[i] = refined_hash_tab[i]->next;
}
printf("\n");
}
}
