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
Write a function that has int parameter n, makes another type of mask having n bit 1's from the left most bit and 32- n bit 0's next. The mask is called netmask in this seminar, an
You are to develop a Clinic System. 1. Identify and briefly explain the objects, classes, methods and attributes for the Clinic System. 2. Draw a use case diagram to represen
Need help with C network program
y=2x-3?_(i=1)^(n+1)¦?i+2?
i have an array of structs, and am trying to make a pointer that can point to a certain struct within the array
I need help with virtual memory manager implementation in C
Automatic Variables Automatic variables are variable which are explained within the functions. They lose their value when the function terminates. It can be accessed only in th
write an algorithm for linear search algorithm
A: this is a procedure during exception handling while the destructor is called for all local objects in the stack among the place where the exception was thrown & where this is ca
What is T y pe C a s t Op er a t o r : T h e f l o a t c a n b e c o n v e r t e d t o i n t e g e r v a l u
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