Find max and min of given number in c language?

Answer 1

#include<stdio.h>

main()

{

int a[50],max,min,n;

printf("enter the noof digits\n");

scanf("%d",&n);

printf("\nenter the numbers");

for(i=0;i<n;i++)

{

scanf("%d",&a[i]);

}

max=a[0];

min=a[0];

for(i=1;i<n;i++)

{

if(max<a[i])

max=a[i];

if(min>a[i])

min=a[i];

}

printf("\n max is %d \n min is %d",max ,min);

}

Answer 2

#include<stdio.h>

int main()

{

int a[20],min,max;

int n;

printf("\nEnter the num of elements: ");

scanf("%d",&n);

printf("Enter the elements\n");

for(int i=0;i<n;i++)

{

scanf("%d",&a[i]);

if(i==0)

{

min=max=a[i];

}

if(a[i]<min)

min=a[i];

else if(a[i]>max)

max=a[i];

}

printf("The largest element is %d. The smallest element is %d.", max, min);

}

Answer 3

Here is a simple way: Iterate through the list, keeping track of the largest and smallest values seen so far. If the current value is less than the smallest, replace the smallest with this value. Replace the largest is the current value is greater than it. When you have finished the loop, you have the minimum and maximum values. Initialize the largest and smallest value variables with MAX_INT and MIN_INT from LIMITS.H to ensure that the first value seen replaces it. Or, set an initialized flag to false during initialization, then in the main loop, if it is false then copy the list value into the smallest and largest values and set it to true.

Answer 4

this is a logic to find the max or min number

it is simple and easy.

int min ,max,a[5];

for(i=1;i<5;i++)//basic for loop for iteration purpose

{

scanf("%d",a[i]);//reading array numbers

if (i==1)

{min=a[i];max=a[i];

}

elseif(a[i]<min)min=a[i];//checking for small no

elseif(a[i]>max)max=a[i];//checking for max number

}

then print the max and min values of the program

i have given you the basic idea at the time of entering the values from the keyboard itself it saves the execution time as well as the memory for using extra for loops

Answer 5

#include<stdio.h>

main()

{

int a[50],max,min,n,i;

printf("enter the noof digits\n");

scanf("%d",&n);

printf("\nenter the numbers");

for(i=0;i<n;i++)

{

scanf("%d",&a[i]);

}

max=a[0];

min=a[0];

for(i=1;i<n;i++)

{

if(max<a[i])

max=a[i];

if(min>a[i])

min=a[i];

}

printf("\n max is %d \n min is %d",max ,min);

}

Answer 6

It is easier to make two recursion functions, one to calculate the maximum and one for the minimum.we will assume that we will calculate the maximum,minimum of an array of size 100

maximam function :

#include

int max(int a[],int size,int num)

{

if (size 0) return num ;

if (num > a[size])

{

num = a[size] ;

return min(a,size - 1,num) ;

}

else return min(a,size - 1,num) ;

}

a main function to test it out :

int main()

{

int i;int a[100];int b,d;

for (i = 0;i<100;i++)

a[i] = i;

b = max(a,99,a[0]) ;

d= min(a,99,a[0]) ;

printf("\n%d\n%d\n",b ,d);

return (0);

}

Answer 7

#include<stdio.h>

main()

{

int a[50],max,min,n;

printf("enter the noof digits\n");

scanf("%d",&n);

printf("\nenter the numbers");

for(i=0;i<n;i++)

{

scanf("%d",&a[i]);

}

max=a[0];

min=a[0];

for(i=1;i<n;i++)

{

if(max<a[i])

max=a[i];

if(min>a[i])

min=a[i];

}

printf("\n max is %d \n min is %d",max ,min);

}

Answer 8

#include<iosys.h>

// Data structure to store min and max valuestypedef struct range {

double min;

double max;

} range_t;

// Returns the min and max values in an array of values of length count

range_t get_range {double* values, unsigned count} {

if (!values !count) /* invoke invalid argument(s) handler */

range_t r = {values[0], values[0]};

for (unsigned k=1; k<size; ++k) {

if (set[k]<r.min) r.min=set[k];

if (set[k]>r.max) r.max=set[k];

}

return r;

}

int main () {

double d[6] = {1.0, 3.14, -2.1, 4.2, -6.0, 2.1};

range_t r = get_range (d, 6);

printf ("Smallest value is: %f\n", r.min); // -6.0

printf ("Largest value is: %f\n", r.max); // 4.2

return 0;

}

Answer 9

Locate and store the largest (max) and smallest (min) values. Then traverse the array looking for a value that is larger than min. If that value is also smaller than max, replace min with that value. After traversing the array, min holds the second largest value. This algorithm requires at least two traversals; both the min and max can be established with a single traversal, then one more traversal to locate the second largest.

The following function will return the range [min:max] of an array of type double:

struct range {double min, double max};

range get_range (double array[], size_t length) {

range r = {array[0], array[0]};

double max = array[0];

for (size_t i=1; i<length; ++i) {

if (r.min>array[i]) r.min=array[i]; if (r.max<array[i]) r.max=array[i];

}

return r;

}

The following function will return the second largest of an array of type double:

double second_largest (double array[], size_t length) {

range r = get_range (array, length);

for (size_t i=1; i<length; ++i) {

if (array[i]>r.min && array[i]<r.max) r.min=array[i]; }

return r.min;

}

Answer 10

int findMax(int x, int y, int z)

{

int max = x;

if(max < y)

max = y;

if(max < z)

max = z;

return max;

}