Two Strings are called the anagram if they contain the same characters. However, the order or sequence of the characters can be different. In this program, our task is to check for two strings that, they are the anagram or not. For this purpose, we are following a simpler approach. First of all, Compare the length of the strings, if they are not equal in the length then print the error message and make an exit, otherwise, convert the string into lower-case for the easy comparisons. Sort both the strings using bubble sort or other sorting methods. If the strings are found to be identical after sorting, then print that strings are anagram otherwise print that strings are not the anagram.
- Define two strings.
- Check for their lengths. If the lengths are not equal, then strings are not an anagram.
- Else, convert the string to lower case character to make the comparison easy.
- Some language allows the strings to provide inbuilt function for sorting of string. If not then convert them to character array for sorting.
- Sort the array.
- Finally, check for the equality of content.
Two Strings are called the anagram if they contain the same characters. However, the order or sequence of the characters can be different.
str1 = "Grab"; str2 = "Brag";