/*
Input a paragraph containing 'n' number
of sentences where (1<=n<=4). The words are to be separated
with single blank space and are in upper case. A sentence may be
terminated either with a full stop (.) or question mark (?). Perform
the followings:
(i) Enter the number of sentences, if
it exceeds the limit show a message.
(ii) Find the number of words in the
paragraph
(iii) Display the words in ascending
order with frequency.
Example 1:
INPUT:
Enter number of sentences:
1
Enter sentences:
TO BE OR NOT TO BE.
OUTPUT:
Total number of words: 6
WORD FREQUENCY
OR 1
NOT 1
TO 2
BE 2
Example 2:
INPUT: Enter number of sentences:
3
Enter sentences:
THIS IS A STRING PROGRAM. IS THIS EASY?
YES, IT IS.
OUTPUT:
Total number of words: 11
WORD FREQUENCY
A 1
STRING 1
PROGRAM 1
EASY 1
YES 1
IT 1
THIS 2
IS 3
*/
A Computer Science portal for geeks. It contains well written, well thought and well explained computer science and programming articles, quizzes and practice/competitive programming/company interview Questions.
ReplyDeletewebsite: geeksforgeeks.org