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();
Problem 1. Discuss polymorphism in c++. Explaining Polymorphism 2. Write a program in c++ to read a 3X2 matrix and find smallest number in that matrix. Writin
#question.Please check .
#question.conversion of tree into binary tree.
Write a program to get the largest element in an array using Function? # include int largest(int b[],int); main() { int lar,a[5]={12,2,36,40,5}; lar=largest(a,n); printf("
Question 1 Explain the concept of constructors and destructors in C++ with programming examples Question 2 Explain the concepts and applications of multiple inheritance and v
what is the purpose of pointer ? what is the syntax? how it works?
Write a program that finds the minimum total number of shelv, C/C++ Programming
codes of central tendencies in C++
#question.A Padovan string P(n) for a natural number n is defined as: P(0) = ‘X’ P(1) = ‘Y’ P(2) = ‘Z’ P(n) = P(n-2) + P(n-3), n>2 where + denotes string concatenation. For a s
Yes. "Memory pools" are useful in many situations. The bad news is that I'll need to drag you through the mire of how it acts before we talk about all the uses. Firstly, recall
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