Untitled
unknown
plain_text
a year ago
856 B
4
Indexable
#include <stdio.h>
int main() {
int n, i;
printf("Enter the number of elements: ");
scanf("%d", &n);
int arr[n];
printf("Enter %d elements:\n", n);
for (i = 0; i < n; i++) {
scanf("%d", &arr[i]);
}
int largest = arr[0], secondLargest = -1;
// Find the largest element
for (i = 1; i < n; i++) {
if (arr[i] > largest) {
largest = arr[i];
}
}
// Find the second largest element
for (i = 0; i < n; i++) {
if (arr[i] != largest) {
if (secondLargest == -1 || arr[i] > secondLargest) {
secondLargest = arr[i];
}
}
}
if (secondLargest == -1) {
printf("There is no second largest element.\n");
} else {
printf("The second largest element is: %d\n", secondLargest);
}
return 0;
}Editor is loading...
Leave a Comment