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
how is a beti a beti
The program sorting.cpp contains a main function for testing the operation of several sort algorithms over various data sizes and data set organisations. The program understands
Project Description: We are seeking someone to search mp3 link form audio or m3u8 for videos. Skills required are .NET, C Programming, Engineering, C# Programming
how can I find the GCD of 2 given numbers using Euclidean Algorithm ?
Scope Rules and Storage Classes The storage class verifies the life of a variable in terms of its duration or its scope. There are four storage classes : automatic static
removing jewel from a necklace
Implementation of the Dictionary class: int Dictionary::find_word(char *s) { char word[81]; for (int i = 0; i if (stricmp(words[i].get_word(word),s) =
Insertion sort - C program: Write a program in c to define a insertion sort. void main() { clrscr(); int a[100],ch,n; cout cin>>n; for (int i=0
Write a Program that illustrate union declaration? A C program encloses the following union declaration: union id { char color[12]; int size; } shirt, blouse; At this
Consider the following algorithm to generate a sequence of numbers. Start with an integer n. If n is even, divide by 2. If n is odd, multiply by 3 and add 1. Repeat this process wi
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