Question

41. (10 points) EXTRA CREDIT: Write a function 'palindrome' to determine if an input string s is a palindrome. Let the empty string be (technically) Aba' is not a palindrome. You may not use the "reversed" string function, you may use either palindrome. Be case sensitive, e.g. a looping control flow to solve the problem. recursion or

Answer 1

#include <bits/stdc++.h>
#include<cmath>
using namespace std;
int main(){
   cout<<"Enter a string:-";
   string a;
   cin>>a;
   for(int i=0;i<a.length()/2;i++){
       if(a[i]!=a[a.length()-i-1]){
           cout<<"Not a palindrome\n";
           return 0;
       }
   }
   cout<<a<<" is a Palindrome\n";

  
}


Enter a string:-ABa Not a palindrome

Enter a string:-aaaa aaaa is a Palindrome

Enter a string:-tat tat is a Palindrome

1 #include <bits/stdc++.h> #include<cmath> using namespace std 3 Eint main 4 cout<<"Enter a string" string a 7 cin>>a; for (int i-0 ;i<a.length () /2 ; i++ ) if (a[il!a [a.length )-i-1]) { cout<<"Not a palindrome \n"; return 0 1 cout<<a<<" is a Palindrome \n"; 4 7