Problem Description:
Write a function that checks whether two words are anagrams. Two words are anagrams if they contain the same letters in any order. For example, “silent” and “listen” are anagrams. The header of the function is as follows:
bool isAnagram(const string& s1, const string& s2)
Write a test program that prompts the user to enter two strings and checks whether they are anagrams. Here is a sample run of the program:
<Output>
Enter a string s1: silent
Enter a string s2: listen
silent and listen are anagrams
<End Output>
<Output>
Enter a string s1: split
Enter a string s2: lisp
split and lisp are not anagrams
<End Output>
Analysis:
(Describe the problem, including input and output in your own words.)
Design:
(Describe the major steps for solving the problem.)
Coding: Using Visual Studio, create the following program. Include the following in the .cpp file:
- Using comments at the top of the file, your first and last name, date, and purpose of the program
- Meaningful comments to explain the code throughout the program.
- Place your initials in front of all variable names (ex. BWs1)
- Place your initials in front of all function names (ex. BWisAnagram())
- Submit the FirstNameLastNameAnagrams.cpp (BridgetWillisAnagrams.cpp) file to the drop box
Testing: (Describe how you test this program)
Submit the following items:
- Submit the Word file
- Submit the .cpp file
