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!
C Program for SORTING
# include stdio.h>
void main()
{
char a;
int *p;
int i,j,temp;
clrscr();
p=&i;
p++;
for(i=1;i<=5;i++)
printf("Enter the %d no.",i);
scanf("%d",&*(p+i));
}
printf("ENTER A FOR ASENDING OR D FOR DECENDING ORDER -");
scanf("%c",&a);
if(a=='a')
for(j=1;j<=5;j++)
if(*(p+i)<*(p+j))
temp=*(p+i);
*(p+i)=*(p+j);
*(p+j)=temp;
else if(a=='d')
if(*(p+i)>*(p+j))
printf("\nThe sorted no is.");
printf("\n%d",*(p+i));
getch();
create algorithm for doubly link list using c data structure
I am having trouble declaring a variable and returning a value from my function.
(i) Vilsmeir reaction
What is the difference between early binding and late binding? What are advantages of early binding? a.) Late binding refers to function calls which aren't resolved until run t
pebble merchant codings in c++
???
A palindrome is a string that reads the same from both the ends. Given a string S convert it to a palindrome by doing character replacement. Your task is to convert S to palindrome
A: Memory that has no pointer pointing to it and there is no method to delete or reuse this memory(object), it causes Memory leak. { Base *b = new base(); } Out of this
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
A string S is said to be "Super ASCII", if it contains the character frequency equal to their ascii values. String will contain only lower case alphabets (''''a''''-''''z'''') and
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