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 MAXIMUM NO, MINIMUM NO AND SORTING
void main()
{
int i,j,t;
int a[5];
clrscr();
for(i=0;i<5;i++)
printf("ENTER THE SINGLE DIGIT= ");
flushall();
scanf("%d",&a[i]);
}
for(j=0;j<5;j++)
if(a[i]>a[j])
t=a[i];
a[i]=a[j];
a[j]=t;
printf("\n");
printf(" %d",a[j]);
printf("\nTHE MAXIMUM NUMBER IS %d\n",a[5]);
printf("THE MINIMUM NUMBER IS %d\n",a[0]);
getch();
OUTPUT :
ENTER THE SINGLE DIGIT : 5
ENTER THE SINGLE DIGIT : 8
ENTER THE SINGLE DIGIT : 1
ENTER THE SINGLE DIGIT : 2
ENTER THE SINGLE DIGIT : 6
8 6 5 2 1
THE MAX. NO IS : 8
THE MIN. NO IS : 1
Write a c++ 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 c
Write a program that writes your name on the monitor ten times. Write this program three times, once with each looping method.
Which one would you prefer - a macro or a function? Actually it depends on the purpose of program! - In case of macros, corresponding code is inserted directly into your sou
First line starts with T, number of test cases. Each test case T contains a necklace (N).
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 string of t
how can i make a program with !(not) operator
why oops
.Create a Csharp solution that will show a maze in the user interface and will show a mouse walking through the maze attempting to locate the exit door (the cheese).
Project Description: Prepare software that will work with our USB hardware that easily lets you backup all the pictures in your computer into the USB stick in one single step. Once
Constructor public class ListNode { // package access members; List can access these directly private E data; // data for this node privateListNode nextNode; /
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