The Program in C that find the maximum, second maximum, position of maximum is given below:
#include <stdio.h>
int main() {
int n, max, second_max, max_pos, second_max_pos, i;
printf("Enter the number of elements in the array: ");
scanf("%d", &n);
int a[n];
printf("Enter the elements of the array: ");
for(i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
max = a[0];
max_pos = 0;
second_max = a[1];
second_max_pos = 1;
for(i = 0; i < n; i++) {
if(a[i] > max) {
second_max = max;
second_max_pos = max_pos;
max = a[i];
max_pos = i;
} else if(a[i] > second_max) {
second_max = a[i];
second_max_pos = i;
}
}
printf("Maximum: %d, at position: %d\n", max, max_pos);
printf("Second Maximum: %d, at position: %d\n", second_max, second_max_pos);
return 0;
}
Output:
Enter the number of elements in the array: 5
Enter the elements of the array: 12
41
09
99
34
Maximum: 99, at position: 3
Second Maximum: 41, at position: 1
Pro-Tips💡
This code takes input of n numbers and finds the maximum, second maximum, position of maximum and position of second maximum from the sequence of n numbers.
It uses two for loops, first for reading the input and second for finding the maximum, second maximum, position of maximum and position of second maximum.
Learn C-Sharp ↗
C-sharp covers every topic to learn about C-Sharp thoroughly.
Learn C Programming ↗
C-Programming covers every topic to learn about C-Sharp thoroughly.
Learn C++ Programming↗
C++ covers every topic to learn about C-Sharp thoroughly.