Question

I was asked to write a program that when divisible by 2- reverses the order of the letters in a sentence

when divisible by 3- changes all lowercase letter into uppercase letters in a sentence

when divisible by 5 skips the vowels in a sentence

this is what I have so far. my reverseMode works fine.

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

void reverseMode(char* str);
void upperMode(char* str);
void goodbyeVowels(char* str);

char str[50], rstr[50]; //initializing my character arrray

int len, i,n;

int main()
{

  
cout << "Please Enter a Sentence: ";// displays message to user
cin.getline(str,50); //stores characters into str
reverseMode(str); //enables function
upperMode(str);
goodbyeVowels(str);
cout << str;
return 0;
  
}

void reverseMode(char* str)
{
  
for (i=0; i<strlen(str)/2; i++){
char temp= str[i];
str[i]=str[strlen(str)-i-1];
str[strlen(str)-i-1] = temp;
}
}

void upperMode(char* str)
{
for (i=0; i <strlen(str)/3; i++){
str[i] = toupper(str[i]);

}
}

void goodbyeVowels (char* str)
{
  
len=strlen(str);
for (i=0; i<len/5; i++)
{
if( str[i] =='a' || str[i] =='e' || str[i] =='i' ||
str[i] =='o' || str[i] =='u' || str[i] =='A' ||
str[i] =='E' || str[i] =='I' || str[i] =='O' ||
str[i] =='U')
{
for (n=i; n<len; n++)
{
str[n]=str[n+1];
  
len--;
}
}
}
}

Answer 1

Answer:

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

void reverseMode(char* str);
void upperMode(char* str);
void goodbyeVowels(char* str);

char str[50], rstr[50]; //initializing my character arrray

int len, i,n;

int main()
{
cout << "Please Enter a Sentence: ";// displays message to user
cin.getline(str,50); //stores characters into str
reverseMode(str); //enables function
upperMode(str);
goodbyeVowels(str);
cout << str;
return 0;

}

void reverseMode(char* str)
{
int len=strlen(str);
if(len%2==0)
{
for (i=0; i<len/2; i++){
char temp= str[i];
str[i]=str[strlen(str)-i-1];
str[strlen(str)-i-1] = temp;
}
}
}

void upperMode(char* str)
{
int len=strlen(str);
if(len%3==0)
{
for (i=0; i <len; i++){
str[i] = toupper(str[i]);
}
}
}

void goodbyeVowels (char* str)
{

len=strlen(str);
if(len%5==0)
{
int currentIndex=0;
for (i=0; i<len; i++)
{
if( str[i] =='a' || str[i] =='e' || str[i] =='i' ||
str[i] =='o' || str[i] =='u' || str[i] =='A' ||
str[i] =='E' || str[i] =='I' || str[i] =='O' ||
str[i] =='U')
{
for (n=i; n<len; n++)
str[n]=str[n+1];
len--;
}
}
}
}
//output: