Example(s):Palindrome, prime, armstrong, "linear search", reverse etc.
Example(s):1575, 1632, 1539 (Only one at a time)
Login
[lwa]
Solved Problem
#CPP#2848
Problem Statement - Proving palindrome array
Write a program to prove that the give array [23,43,51,43,23] is a palindrome array, means that its reversed pattern will be same as its original pattern.
Solution
TC++ #2848
Run Output
Given array is a palindrome
int arr[5]={23,43,51,43,23}; //array as given has been declared. int cnt=sizeof(arr)/sizeof(arr[0]);
This is a way to find out count of members in the array. We calculate the total number of bytes in whole array divided by total number of bytes in the first member of array.
int notpalin=0; A flag for palindrome check is set here
for(int i=0;i<cnt/2;++i)
This loop we run till mid point of the array as it is sufficient for the palindrome check.
{ if(arr[i]!=arr[cnt-i-1])
Match the first and last member and then next and last but one and then so on.
{ notpalin=1; break;
Set the flag as soon as a mismatch is found and then no match is required further so break and come out of the loop
}
} if(notpalin) cout<<“Given array is not a palindrome”<<endl; else cout<<“Given array is a palindrome”<<endl;
Print the message as per the flag contidion
Notes
This program will work even if the loop is traverse for the whole array and mot just till the mid point, but it would be an unnecessary extra effort.
