Program to determine whether two strings are the anagram

Python

str1 = "Grab";  
str2 = "Brag";   
#Checking for the length of strings  
if(len(str1)!= len(str2)):  
    print ("Both the strings are not anagram");  
else:  
    #Converting the strings to lower case  
    str1 = str1.lower();  
    str2 = str2.lower();  
    #Sorting the strings  
    str1 = ''. join(sorted(str1));  
    str2 = ''. join(sorted(str2));  
      
    if (str1 == str2):  
        print ("Both the strings are anagram");   
    else:  
        print ("Both the strings are not anagram");  

Output:

Both the strings are anagram.

C

#include <stdio.h>  
#include <string.h>  
void toLowercase(char[]);  
void sortArray(char[]);  
int main ()  
{  
    char str1[] = "Grab", str2[] = "Brag";  
    int i, j = 0;  
      
    //Checking for the length of strings  
    if(strlen(str1) != strlen(str2)){  
        printf("Both the strings are not anagram");  
        return 0;  
    }  
    else {  
    //converting the string to lowercase  
    toLowercase(str1);  
    toLowercase(str2);  
      
    //Sorting the arrays by making call to user defined function sortArray()  
    sortArray(str1);  
    sortArray(str2);  
      
    for(i = 0; i < strlen(str1); i++){  
       if(str1[i] != str2[i]){  
           printf("Both the strings are not anagram");  
           return 0;  
       }   
    }     
    printf("Both the strings are anagram");  
    }  
    return 0;  
}  
void toLowercase(char a[]){  
            int i;  
            for(i = 0; i < strlen(a)-1; i++){  
                a[i] = a[i]+32;  
            }      
        }  
 void sortArray(char a[]){  
            int temp = 0,i,j;  
            for(i = 0; i < strlen(a)-1; i++){  
                for (j = i+1; j < strlen(a); j++){  
                if(a[i] > a[j]) {  
                    temp = a[i];  
                    a[i] = a[j];  
                    a[j] = temp;         
                    }  
                }  
            }     
        }  

Output:

Both the strings are anagram.

JAVA

import java.util.Arrays;  
public class Anagram {      
    public static void main (String [] args) {          
        String str1="Brag";  
        String str2="Grab";  
          
        //Converting both the string to lower case.  
        str1 = str1.toLowerCase();  
        str2 = str2.toLowerCase();  
          
        //Checking for the length of strings  
        if (str1.length() != str2.length()) {  
            System.out.println("Both the strings are not anagram");  
        }  
        else {  
            //Converting both the arrays to character array  
            char[] string1 = str1.toCharArray();  
            char[] string2 = str2.toCharArray();  
              
            //Sorting the arrays using in-built function sort ()  
            Arrays.sort(string1);  
            Arrays.sort(string2);  
              
            //Comparing both the arrays using in-built function equals ()  
            if(Arrays.equals(string1, string2) == true) {  
                System.out.println("Both the strings are anagram");  
            }  
            else {  
                System.out.println("Both the strings are not anagram");  
            }  
        }  
    }  
}  

Output:

Both the strings are anagram.

C#

using System;  
public class Program  
{  
    public static void Main ()  
    {  
        string str1="Brag";  
        string str2="Grab";  
          
        //Converting both the string to lower case and then removing white spaces.  
        str1 = str1.ToLower();  
        str2 = str2.ToLower();  
          
        //Checking for the length of strings  
        if(str1.Length != str2.Length) {  
            Console.WriteLine("Both the strings are not anagram");  
        }  
   
        else {   
            //Converting both the arrays to character array  
            char[] string1 = str1.ToCharArray();  
            char[] string2 = str2.ToCharArray();  
              
            //Sorting the arrays using in-built function sort ()  
            Array.Sort(string1);  
            Array.Sort(string2);  
              
            //Comparing both the strings using in-built function equals ()  
            if(string1.ToString().Equals(string2.ToString())) {  
                Console.WriteLine("Both the strings are anagram");  
            }  
            else {  
                Console.WriteLine("Both the strings are not anagram");  
            }  
        }  
    }  
}  

Output:

Both the strings are anagram.

PHP

<!DOCTYPE html>  
<html>  
<body>  
<?php  
    $str1 = "Grab";  
    $str2 = "Brag";  
      
    //Checking for the length of strings  
    if(strlen($str1) != strlen($str2)){  
        echo "Both the strings are not anagram";  
    }  
    else{  
        //Convert strings to lower case  
        $str1 = strtolower($str1);  
        $str2 = strtolower($str2);  
      
        //Splitting the array to convert it into array  
        $str1array = str_split($str1);  
        $str2array = str_split($str2);  
      
        //Sorting arrays of character  
        sort($str1array);  
        sort($str2array);  
      
        //Joining the characters from array to convert it into single string  
        $str1 = implode("",$str1array);  
        $str2 = implode("",$str2array);  
  
        //Comparing two strings, it returns 0 when the strings are equal else -1  
        if(strcmp($str1,$str2) == 0){  
            echo "Both the strings are anagram";  
        }  
        else{  
            echo "Both the strings are not anagram";  
        }  
    }  
?>  
</body>  
</html>  

Output:

Both the strings are anagram.