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();
C Program to copy the contents of a file: void main() { ifstream fin("input.txt"); ofstream fout("output.txt"); char ch; while (fin) {
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. The area under a curve between two points can b
Addition in a existing c++ unification algorithm Project Description: I have a existing code for a algorithm and need to add two modules into it, it is a unification algorith
Manipulators There are several classes in the iostream.h header file. One of them is ios class. This class stores the format state. For example, some bits explain the base in w
A game is played with three piles of stones and two players. At her turn, a player removes one or more stones from the piles. However, if she takes stones from more than one pile,
#compiler design limit the instruction#
Help for tomorrow...?
genetic disorder
padovan string problem program 1 : package test.padovanstring; public class PadovanString { public int stringOccurrences(int n, String str){ if(n >= 40)
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