Answer: Store the n numbers in an array, take max = a[0] and replace it whenever a larger element is found.
Logic: after one pass through the array, max holds the largest value.
Program:
#include <stdio.h>
int main()
{
int n, i;
int a[100], max;
printf("How many numbers (1 to 100)? ");
scanf("%d", &n);
printf("Enter %d numbers: ", n);
for (i = 0; i < n; i++)
scanf("%d", &a[i]);
max = a[0];
for (i = 1; i < n; i++)
{
if (a[i] > max)
max = a[i];
}
printf("Largest number = %d\n", max);
return 0;
}Sample output (actual run):
How many numbers (1 to 100)? 5
Enter 5 numbers: 12 45 7 89 23
Largest number = 89