Sorun çözülmüştür:
Function 1 int lenght(char const* array) {
int len = 1;
for(int i=0; array[i]!='\0'; array++) {
len++;
}
return len;
}
Function 2 int is_anagram(char const* arr1, char const* arr2)
{
int arr1_len = lenght(arr1);
int arr2_len = lenght(arr2);
if(arr1_len != arr2_len)
return FALSE;
char carr1[arr1_len];
char carr2[arr2_len];
for(int i=0; i<arr1_len; i++)
{
carr1[i] = arr1[i];
carr2[i] = arr2[i];
}
int j;
char temp;
for(int i=0; i<arr1_len-2; i++) //sorting algorithm
{
j = i;
for(; j carr1[j]) {
temp = carr1[i];
carr1[i] = carr1[j];
carr1[j] = temp;
}
if(carr2[i] > carr2[j]) {
temp = carr2[i];
carr2[i] = carr2[j];
carr2[j] = temp;
}
}
}
for(int i=0; i<arr1_len; i++) {
if(carr1[i] != carr2[i])
return FALSE;
}
return TRUE;
}