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
lcm program.
Shell sort - C Program: Write a program to define shell sort. void main() { //program for sorting by select sort int a[20],i,k,j,n; clrscr();
#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
Write a function that has an int parameter n, makes an integer mask having the bit 1 at the nth place from the rightmost bit, and returns the mask. For example, when n = 5 is passe
1. The main program must be in a file called A4.cpp 2. The data must be read in from a data file. The user must enter the filename. A sample data file will be provided on Mood
Call by Reference Passing variables(parameters) to a function in C can be done in two ways - pass by value, also called as call by value and pass by address or also known as ca
what do you mean by control word
Q: In p = new Fred(), does the Fred memory "leak" if Fred constructor throws an exception? A: No. If an exception take place during the Fred constructor of p = new F
obtain two numbers from thekey board,and determain and display(if either)is the larger of two numbers.
C program to Print Fibonacci series upto n using recursion: int fibo(long int); void main() { long int a=0,n; printf ("how many term
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