MATRIX
STRING OPERATIONS USING SWITCH
CASE.
#include<conio.h>
int getlen(char s[10]);
void rev(char s1[10],int n1);
void compare(char s1[10],char s2[10],int n1,int n2);
void palindrome(char s1[10],int n1);
void copy(char s1[10],char s3[10],int n1);
void substring(char s1[10],int n1);
void main()
{
int i,n1,n2,n,op;
char s1[10],s2[10],s3[10];
clrscr();
printf("Enter 1st string\n");
scanf("%s",s1);
printf("Enter 2nd string\n");
scanf("%s",s2);
n1=getlen(s1);
printf("length of 1st string is=%d\n",n1);
n2=getlen(s2);
printf("length of 2nd string is=%d\n",n2);
printf("Enter\n 1 for reverse of string.\n 2 for compare of string.\n 3 for palindrome.\n 4 for copy of string.\n 5 for substring.");
scanf("%d",&op);
switch(op)
{
case 1:rev(s1,n1);
rev(s2,n2);
break;
case 2:compare(s1,s2,n1,n2);
break;
case 3:palindrome(s1,n1);
palindrome(s2,n2);
break;
case 4:copy(s1,s3,n1);
copy(s2,s3,n2);
break;
case 5:substring(s1,n1);
substring(s2,n2);
break;
}
getch();
}
int getlen(char s[10])
{
int i,a=0;
for(i=0;s[i]!='\0';i++)
a++;
return(a);
}
void rev(char s1[10],int n1)
{
int i;
printf("reverse of string is");
for(i=n1;i>=0;i--)
{
printf("%c",s1[i]);
}
printf("\n");
}
void compare(char s1[10],char s2[10],int n1,int n2)
{
int i,flag;
if(n1==n2)
{
flag=0;
for(i=0;i<n1;i++)
{
if(s1[i]==s2[i])
flag=1;
}
if(flag==1)
printf("Two strings are equal");
}
else
printf("Two strings are not equal");
}
void palindrome(char s1[10],int n1)
{
int i=0,j,flag; n1=n1--;
for(j=n1;j>=0;j--)
{
flag=0;
if(s1[i]==s1[j])
flag=1;
if(s1[i]!=s1[j])
{
break;
}
if(i==j)
{
break;
}
i++;
}
if(flag==1)
printf("String is palindrome\n");
else
printf("String is not palindrome\n");
}
void copy(char s1[10],char s3[10],int n1)
{
int i;
for(i=0;i<n1;i++)
{
s3[i]=s1[i];
}
for(i=0;i<n1;i++)
{
printf("%c",s3[i]);
}
printf("\n");
}
void substring(char s1[10],int n1)
{
char r[10],a[10]; int i,j=0;
printf("Enter substring\n");
scanf("%s",r);
for(i=0;i<n1;i++)
{
if(s1[i]==r[j])
{ a[j]=r[j];
j++;
}
}
if(a[10]==r[10])
{
printf("substring is present\n"); }
else
printf("substring is not present\n");
}
No comments:
Post a Comment
If you have any problems related to solutions or any concept please let me know.