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
what is spanning tree? explain prims algorithm spanning tree?
#compiler design limit the instruction#
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
enter height of the shape: 1 3 5 3 1 3 5 7 5 3 5 7 9 7 5 3 5 7 5 3 1 3 5 3 1
write a program in c language to implement stacks in a single array
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
#include #include #include void* memorycopy (void *des, const void *src, size_t count) { size_t n = (count + 7) / 8; char* destination = (char *) des; char* source =
Part 1 Assignment: develop a calculator in MASM. Text chapters covered: 1 through 4, 5.4, 5.5, 6.3, 7.4 You will develop a "calculator" algorithm in MASM using reverse-
brief note on multiple stack
The Special Pointer 'this' When various instances of a class come into existence, it naturally follows that each instance has its own copy of member variables. If this were not
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