Two words are anagrams if they are formed by rearranging the letters of another, such as cinema, formed from iceman, and vice versa. Implement an anagram checker function using string functions in C. Your program should be able to: 1. Scan for the two words to be checked 2. Pass those two words to a function called areAnagrams which returns an int to be interpreted in the main() whether the given words are anagrams or not. 3. The program should loop indefinitely until the words "EXIT NOW" is used as input. Sample Run: Enter two strings: cinema iceman cinema and iceman are anagrams! Enter two strings: almost atoms almost and atoms are NOT anagrams Enter two strings: vice versa vice and versa are NOT anagrams! Enter two strings: frail flare frail and flare are NOT anagrams! Enter two strings: algorithm logarithm algorithm and logarithm are anagrams! Enter two strings: EXIT NOW
Two words are anagrams if they are formed by rearranging the letters of another, such as cinema, formed from iceman, and vice versa. Implement an anagram checker function using string functions in C. Your program should be able to: 1. Scan for the two words to be checked 2. Pass those two words to a function called areAnagrams which returns an int to be interpreted in the main() whether the given words are anagrams or not. 3. The program should loop indefinitely until the words "EXIT NOW" is used as input. Sample Run: Enter two strings: cinema iceman cinema and iceman are anagrams! Enter two strings: almost atoms almost and atoms are NOT anagrams Enter two strings: vice versa vice and versa are NOT anagrams! Enter two strings: frail flare frail and flare are NOT anagrams! Enter two strings: algorithm logarithm algorithm and logarithm are anagrams! Enter two strings: EXIT NOW
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question

Transcribed Image Text:Two words are anagrams if they are formed by rearranging the letters of another, such as
cinema, formed from iceman, and vice versa.
Implement an anagram checker function using string functions in C.
Your program should be able to:
1. Scan for the two words to be checked
2. Pass those two words to a function called areAnagrams which returns an int to be
interpreted in the main() whether the given words are anagrams or not.
3. The program should loop indefinitely until the words "EXIT NOW" is used as input.
Sample Run:
Enter two strings: cinema iceman
cinema and iceman are anagrams!
Enter two strings: almost atoms
almost and atoms are NOT anagrams
Enter two strings: vice versa
vice and versa are NOT anagrams!
Enter two strings: frail flare
frail and flare are NOT anagrams!
Enter two strings: algorithm logarithm
algorithm and logarithm are anagrams!
Enter two strings: EXIT NOW
Expert Solution

This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 1 images

Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you

Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education

Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON

Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON

Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education

Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON

Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON

C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON

Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning

Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education