c++ (c-string ,dynamic array , and pointer)
and WebsuThis prac will also test your knowledge of C-Strings, dynamic arrays, and pointers. This prae deals with strings. You are enoouraged to try different implementation methods (eg, try both A phrase is called a Palindrome if it is the same once reversed. Reversing Race fast, safe car\" gives std::string and C-string) us rac efas ,tsaf ecaR\", which is actually the same as the original phrase if we ignore non-alphabetical charucters and cases. Phrases like these are called Palindrones. You are asked to create a Palindrome class that stores a phrase and supports three methods remove NonLetters: remove all non-alphabetical characters from the phrase wrCase change all letters in tbe phrase into lower cases
Solution
#include<iostream>
using namespace std;
int main(){
char string1[20];
int i, length;
int flag = 0;
cout << \"Enter a string: \";
cin >> string1;
length = strlen(string1);
for(i=0;i < length ;i++){
if(string1[i] != string1[length-i-1]){
flag = 1;
break;
}
}
if (flag) {
cout << string1 << \" is not a palindrome\" << endl;
}
else
{
cout << string1 << \" is a palindrome\" << endl;
}
system(\"pause\");
return 0;
}
.
c++ (c-string -dynamic array - and pointer) and WebsuThis prac will.docx
1. c++ (c-string ,dynamic array , and pointer)
and WebsuThis prac will also test your knowledge of C-Strings, dynamic arrays, and pointers.
This prae deals with strings. You are enoouraged to try different implementation methods (eg, try
both A phrase is called a Palindrome if it is the same once reversed. Reversing Race fast, safe
car" gives std::string and C-string) us rac efas ,tsaf ecaR", which is actually the same as the
original phrase if we ignore non-alphabetical charucters and cases. Phrases like these are called
Palindrones. You are asked to create a Palindrome class that stores a phrase and supports three
methods remove NonLetters: remove all non-alphabetical characters from the phrase wrCase
change all letters in tbe phrase into lower cases
Solution
#include<iostream>
using namespace std;
int main(){
char string1[20];
int i, length;
int flag = 0;
cout << "Enter a string: ";
cin >> string1;
length = strlen(string1);
for(i=0;i < length ;i++){
2. if(string1[i] != string1[length-i-1]){
flag = 1;
break;
}
}
if (flag) {
cout << string1 << " is not a palindrome" << endl;
}
else
{
cout << string1 << " is a palindrome" << endl;
}
system("pause");
return 0;
}
![c++ (c-string ,dynamic array , and pointer)
and WebsuThis prac will also test your knowledge of C-Strings, dynamic arrays, and pointers.
This prae deals with strings. You are enoouraged to try different implementation methods (eg, try
both A phrase is called a Palindrome if it is the same once reversed. Reversing Race fast, safe
car" gives std::string and C-string) us rac efas ,tsaf ecaR", which is actually the same as the
original phrase if we ignore non-alphabetical charucters and cases. Phrases like these are called
Palindrones. You are asked to create a Palindrome class that stores a phrase and supports three
methods remove NonLetters: remove all non-alphabetical characters from the phrase wrCase
change all letters in tbe phrase into lower cases
Solution
#include<iostream>
using namespace std;
int main(){
char string1[20];
int i, length;
int flag = 0;
cout << "Enter a string: ";
cin >> string1;
length = strlen(string1);
for(i=0;i < length ;i++){](https://image.slidesharecdn.com/cc-string-dynamicarray-andpointerandwebsuthispracwill-230204022356-28ec99bd/85/c-c-string-dynamic-array-and-pointer-and-WebsuThis-prac-will-docx-1-320.jpg)
![if(string1[i] != string1[length-i-1]){
flag = 1;
break;
}
}
if (flag) {
cout << string1 << " is not a palindrome" << endl;
}
else
{
cout << string1 << " is a palindrome" << endl;
}
system("pause");
return 0;
}](data:image/gif;base64,R0lGODlhAQABAIAAAAAAAP///yH5BAEAAAAALAAAAAABAAEAAAIBRAA7)