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
void main() { int *p, *q, i ; p=(int*)100; q=(int*)200; i=q-p; printf("%d",i); } }
given integer ''n'' and permutation of numbers 1,2,..n-1, c program to print permutation that lexicograghically precedes given input permutation if permutation is least print input
Write a program that finds the minimum total number of shelves, including the initial one required for this loading process.
I need to make a fractal trees in OpenGL C++ . The method used is to write a recursive function with cylinders of different sizes and angles to create the tree trunk and branches.
I need a client-server architecture program for windows OS (minimum support: Win 7),. the agent program will run as a background process and perform certain tasks every X time, and
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)
C program to Print Fibonacci series upto n using recursion: int fibo(long int); void main() { long int a=0,n; printf ("how many term
A: In C, encapsulation was completed by making things static in a compilation unit or module. It prevented another module from accessing the static stuff. (Incidentally, now static
Objects as Function Arguments: In C program there are several methods to define arguments, and in some case even a structure can be approved as an argument. Similarly in C+
Ask question #Minimum 100 words awhat is the pre condition for binary searching ccepted#
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