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 an algorithm to print all even numbers in descending order and draw the flowchart.
Write a simple program in C++ to investigate the safety of its enumeration types. Include at least 10 different operations on enumeration types that are incorrect/unsafe things to
Need FTP Upload and MySQL Project Description: We are in need of an executable application that will be execute as a scheduled task on Windows Server 2008 R2 and can perform
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. #include float start
what is polymorphism
Determine the types of Container class Container class can be of 2 types: - Heterogeneous container - Here container class comprise a group of mixed objects - Homogeneou
implement two stacks in one array A[1...n] in such a way that neither stack overflows unless the total number of elements in both stacks together is n. For this you need to produce
What is copy constructor? describe the concept of copy constructor.
Project Description: Online game development Online Live Baccarat Game is needed - client program. - server program(IOCP or ect..). - web program(ASP or PHP or etc..
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