Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
#include stdio.h>
#include conio.h>
#include string.h>
void main()
{
char a[50],b[25][25],l[25],temp1;
int i=0,j=0,k=0,l1[25],c=0,c1=0,t=0,temp;
clrscr();
for(i=0;i<25;i++)
for(j=0;j<25;j++)
l[i]='0';
l1[i]=0;
b[i][j]='0';
}
i=0;
j=0;
printf("ENTER THE STRING= ");
flushall();
do
a[i++]=getchar();
}while(a[i-1]!='\n');
a[i-1]='\0';
for(i=0;a[i]!='\0';i++)
if(a[i]!=' ')
if(t==0)
l[c]=a[i];
t++;
l1[c]=c+1;
b[c][c1++]=a[i];
else
c++;
c1=0;
t=0;
for(i=0;l1[i]!=0;i++)
for(j=0;l1[j]!=0;j++)
if(l[i] { temp1=l[i]; l[i]=l[j]; l[j]=temp1; temp=l1[i]; l1[i]=l1[j]; l1[j]=temp; } } } for(i=0;l1[i]!=0;i++) { for(j=0;l1[j]!=0;j++) { if(l1[i]==j+1) { for(k=0;b[j][k]!='0';k++) printf("%c",b[j][k]); printf("\n"); } } } getch(); } OUTPUT : ENTER THE STRING: KAMLESH D MENGAR D KAMLESH MENGAR
temp1=l[i];
l[i]=l[j];
l[j]=temp1;
temp=l1[i];
l1[i]=l1[j];
l1[j]=temp;
if(l1[i]==j+1)
for(k=0;b[j][k]!='0';k++)
printf("%c",b[j][k]);
printf("\n");
getch();
OUTPUT :
ENTER THE STRING: KAMLESH D MENGAR
D
KAMLESH
MENGAR
program
#quesdifferentiate betweenrelocatable and self relocating program with exampletion..
How do you declare an integer variable? Explain with an example.
Define Virtual Destructor?
Project Description: I need to convert AFL code of Amibroker to DLL plugin to hide original formula, and also to protect the DLL and making it hardware locked. I need to wrap th
Write a program to find the area under the curve y = f(x) between x = a and x = b, integrate y = f(x) between the limits of a and b.
c progam for decode the code
what is spanning tree? explain prims algorithm spanning tree?
Passing and Returning Objects Objects can be passed to a function and returned back just like normal variables. When an object is passed by content, the compiler makes another
Implement a Algorithm to verify if the link list is in Ascending order? A: template bool linklist::isAscending() const{ nodeptr ptr = head; while (ptr->_next)
Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd