Showing posts with label Programs and Solutions. Show all posts
Showing posts with label Programs and Solutions. Show all posts
Palindrome using pointer
#include<stdio.h>
#include<conio.h>
#include<string.h>
void main()
{
int c=0,d;
char str[30];char *a,*b;
clrscr();
printf("Enter the string:");
scanf("%s",str);
a=str;
for(a=str; *a!='\0';a++);
--a;
for(b=str; *b==*a; b++)
{
c=c+1;
--a;
}
d=strlen(str);
if(c==d)
printf("\nGiven String is Palindrome");
else
printf("\nGiven string is not palindrome");
getch();
}
Sample Output:

#include<conio.h>
#include<string.h>
void main()
{
int c=0,d;
char str[30];char *a,*b;
clrscr();
printf("Enter the string:");
scanf("%s",str);
a=str;
for(a=str; *a!='\0';a++);
--a;
for(b=str; *b==*a; b++)
{
c=c+1;
--a;
}
d=strlen(str);
if(c==d)
printf("\nGiven String is Palindrome");
else
printf("\nGiven string is not palindrome");
getch();
}
Sample Output:
Write a program to get two different array values , merge them and finally produce the ascending order sorting of the result. (array Concept)
Program:
#include<stdio.h>
#include<conio.h>
void main()
{
int a[25],b[25],n,g=0,m,i,j,c,temp;
clrscr();
printf("Enter the number of a: ");
scanf("%d",&n);
printf("\nEnter the no of b: ");
scanf("%d",&m);
printf("\nEnter a values\n");
for(i=1; i<=n ; i++)
scanf("%d",&a[i]);
printf("\nEnter b values\n");
for(j=1; j<=m ; j++)
{
scanf("%d",&b[j]);
a[i]=b[j];
i++;
}
printf("\nMerged values:\n");
c=n+m;
for(i=1; i<=c; i++)
printf("%d\t",a[i]);
while(g < c)
{
for(i=1; i<=c; i++)
if(a[i]>a[i+1])
{
temp=a[i];
a[i]=a[i+1];
a[i+1]=temp;
}
else
a[i]=a[i];
++g;
}
printf("\nSorted Values:\n");
for(i=1; i<=c; i++)
printf("%d\t",a[i]);
getch();
}
Sample Output:
#include<stdio.h>
#include<conio.h>
void main()
{
int a[25],b[25],n,g=0,m,i,j,c,temp;
clrscr();
printf("Enter the number of a: ");
scanf("%d",&n);
printf("\nEnter the no of b: ");
scanf("%d",&m);
printf("\nEnter a values\n");
for(i=1; i<=n ; i++)
scanf("%d",&a[i]);
printf("\nEnter b values\n");
for(j=1; j<=m ; j++)
{
scanf("%d",&b[j]);
a[i]=b[j];
i++;
}
printf("\nMerged values:\n");
c=n+m;
for(i=1; i<=c; i++)
printf("%d\t",a[i]);
while(g < c)
{
for(i=1; i<=c; i++)
if(a[i]>a[i+1])
{
temp=a[i];
a[i]=a[i+1];
a[i+1]=temp;
}
else
a[i]=a[i];
++g;
}
printf("\nSorted Values:\n");
for(i=1; i<=c; i++)
printf("%d\t",a[i]);
getch();
}
Sample Output:
Subscribe to:
Posts (Atom)
