ask. red to submit as a part of assignment 2) Create a one-dimensional array to
ID: 3872252 • Letter: A
Question
ask. red to submit as a part of assignment 2) Create a one-dimensional array to read 20 alphabetical letters (your program should be able to detect and print out an error message if a non-alphabetical letter is entered). As eacn letter is entered, print a message saying "duplicate letter if the letter is already in the array. Write a function that can sort the array after all 20 letters have been entered. Write another function that print out the most frequent letter and number of times it was entered. Prepare for the case where all 20 letters are different, or all are the same [Make use of sample solution given for Task 72] Sample output: since RajiPro Ance w/ISD/TSD_TP2201 Seek? Enter 2a alphabets 2 is a duplicate letter. 4 is not an alphabet Is is not an alphabet is a duplicate letter. is a duplicate letter. i is a duplicate letter. is a duplicate letter. is a duplicate letter. is a duplicate letter. 1 is a duplicate letter. is a duplicate letter.Explanation / Answer
#include<iostream>
using namespace std;
void sortArray(char letters[20]);
void mostFreq(int freq[26],char letters[20]);
int main(){
char letters[20];
int temp,freq[26]={0};
int i=0,j;
cout<<"Enter 20 alphabets ";
for(i=0;i<20;i++){
cin>>letters[i];
if((letters[i]<'a'||letters[i]>'z')){
cout<<letters[i]<<" is not an alphabet"<<" ";
i--;
}
else{
temp= ++freq[letters[i]-'a'];
if(temp>1)
cout<<letters[i]<<" is a duplicate letter"<<" ";
}
}
cout<<" The original Array is : ";
for(i=0;i<20;i++){
cout<<letters[i];
}
cout<<" ";
sortArray(letters);
mostFreq(freq,letters);
return 0;
}
void sortArray(char letters[20]){
for(int i=0;i<20;i++){
for(int j=0;j<20-i;j++){
if(letters[j]>letters[j+1]){
char temp=letters[j];
letters[j]=letters[j+1];
letters[j+1]=temp;
}
}
}
cout<<" The Sorted array is: ";
for(int i=0;i<20;i++){
cout<<letters[i];
}
}
void mostFreq(int freq[26],char letters[20]){
int max=0, index;
for(int i=0;i<26;i++){
if(max<freq[i]){
max=freq[i];
index=i;
}
}
if(max==20){
cout<<" All Characters are the same";
}
else{
cout<<" Mode is "<<char('a'+index);
cout<<" and it is occuring "<<freq[index]<<" times";
}
Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.