# Anagram words

  • An anagram is a word made by using letters of another word in a different order.

  • Example: later & alert , earth & heart.

  • For two words to be anagrams they should have:

    1. Same number of letters
    2. made up of same letters, which may be arranged in different order.
  • Steps:

    1. Check if both words have same length, if not they cannot be anagrams.
    2. If yes, Sort both words and compare them letter by letter.
    3. If all letters are same they both are anagrams.

# Source Code - C++

#include <iostream>
#include <string>
#include <algorithm>
using namespace std;

bool isAnagram (string A, string B){
 int n1, n2, i;
 n1 = A.length();
 n2 = B.length();
 if(n1 != n2)
  return false;
 sort(A.begin(), A.end());
 sort(B.begin(), B.end());

 for(i =0 ; i<n1 ; i++)
  if( A[i] != B[i] )
  return false;
return true;

int main()
 string A,B;
 bool ans;
 cout<<"Enter first word\n";
 cout<<"Enter second word\n";
 ans = isAnagram(A,B);
 cout<<"Words are anagrams\n";
 cout<<"Words are not anagrams";
 return 0;

Time Complexity : O(nlogn)