Write functions to convert string to upper case lower case reverse of string check palindrome ascending descending order in c plus plus codes?

Answer 1

#include<iostream>

#include<list>

#include<string>

#include<vector>

void to_upper(std::string& str)

{

for(std::string::iterator it=str.begin(); it!=str.end(); ++it )

if( *it>='a' && *it<='z' )

*it-=32;

}

void to_lower(std::string& str)

{

for(std::string::iterator it=str.begin(); it!=str.end(); ++it )

if( *it>='A' && *it<='Z' )

*it+=32;

}

void to_ascending(std::string& str)

{

for(size_t i=1; i<str.size(); ++i)

{

char c=str[i];

int hole=i;

while(hole && c<str[hole-1])

{

str[hole]=str[hole-1];

--hole;

}

str[hole]=c;

}

}

void to_descending(std::string& str)

{

for(size_t i=1; i<str.size(); ++i)

{

char c=str[i];

int hole=i;

while( hole && c>str[hole-1] )

{

str[hole]=str[hole-1];

--hole;

}

str[hole]=c;

}

}

void to_reverse(std::string& str)

{

std::string rev;

for(std::string::reverse_iterator it=str.rbegin(); it!=str.rend(); ++it )

rev+=*it;

str=rev;

}

bool palindromes(std::string& str, std::list<std::string>& lst )

{

lst.clear();

std::vector<int> v;

std::string copy( str );

to_lower( copy );

size_t pos;

for(pos=0; pos<copy.size(); ++pos)

{

char& c=copy[pos];

if((c>='a' && c<='z') (c>='A' && c<='Z'))

{

if(v.size())

v.push_back(-1);

v.push_back(pos);

}

}

for(pos=1; pos<v.size()-1; ++pos)

{

size_t left=pos-1;

size_t right=pos+1;

while((left<right && right<v.size()) && (v[left]==-1 copy[v[left]]==copy[v[right]]))

{

--left;

++right;

}

do

{

++left;

--right;

}

while(v[left]==-1);

if(left<right)

lst.push_back(str.substr(v[left], v[right]-v[left]+1));

}

return(lst.size()!=0);

}

void process(const std::string& str)

{

std::cout<<"Original:\t""<<str.c_str()<<"""<<std::endl;

std::string mod;

mod=str;

to_upper(mod);

std::cout<<"to_upper:\t""<<mod.c_str()<<"""<<std::endl;

mod=str;

to_lower(mod);

std::cout<<"to_lower:\t""<<mod.c_str()<<"""<<std::endl;

mod=str;

to_reverse(mod);

std::cout<<"to_reverse:\t""<<mod.c_str()<<"""<<std::endl;

mod=str;

to_ascending(mod);

std::cout<<"to_ascending:\t""<<mod.c_str()<<"""<<std::endl;

mod=str;

to_descending(mod);

std::cout<<"to_descending:\t""<<mod.c_str()<<"""<<std::endl;

mod=str;

std::list<std::string> lst;

if(palindromes(mod,lst))

for each(std::string str in lst)

std::cout<<"Palindrome:\t""<<str.c_str()<<"""<<std::endl;

else

std::cout<<"No palindromes were found!\n";

std::cout<<std::endl;

}

int main()

{

std::string str;

str = "The quick brown fox jumps over the lazy dog.";

process(str);

str = "Madam, I'm Adam.";

process(str);

str = "In girum imus nocte et consumimur igni.";

process(str);

}

Output:

Original: "The quick brown fox jumps over the lazy dog."

to_upper: "THE QUICK BROWN FOX JUMPS OVER THE LAZY DOG."

to_lower: "the quick brown fox jumps over the lazy dog."

to_reverse: ".god yzal eht revo spmuj xof nworb kciuq ehT"

to_ascending: " .Tabcdeeefghhijklmnoooopqrrstuuvwxyz"

to_descending: "zyxwvuutsrrqpoooonmlkjihhgfeeedcbaT. "

No palindromes were found!

Original: "Madam, I'm Adam."

to_upper: "MADAM, I'M ADAM."

to_lower: "madam, i'm adam."

to_reverse: ".madA m'I ,madaM"

to_ascending: " ',.AIMaaaddmmm"

to_descending: "mmmddaaaMIA.,' "

Palindrome: "Madam"

Palindrome: "Madam, I'm Adam"

Palindrome: "m Adam"

Original: "In girum imus nocte et consumimur igni."

to_upper: "IN GIRUM IMUS NOCTE ET CONSUMIMUR IGNI."

to_lower: "in girum imus nocte et consumimur igni."

to_reverse: ".ingi rumimusnoc te etcon sumi murig nI"

to_ascending: " .Icceeggiiiiimmmmnnnnoorrssttuuuu"

to_descending: "uuuuttssrroonnnnmmmmiiiiiggeeccI. "

Palindrome: "um imu"

Palindrome: "In girum imus nocte et consumimur igni"

Palindrome: "umimu"