Search results

Calculator

Status: Open.

#476 In AllAlgorithms/c;

· Siddharth090105 opened on Feb 3, 2025

Calculator

Status: Open.

#475 In AllAlgorithms/c;

· Geethesh12 opened on Feb 3, 2025

Calculator

Status: Open.

#474 In AllAlgorithms/c;

· munitharun7 opened on Feb 3, 2025

Calculator

Status: Open.

#473 In AllAlgorithms/c;

· Vikash130704 opened on Feb 3, 2025

Calculator

Status: Open.

#472 In AllAlgorithms/c;

· vinay-326 opened on Feb 3, 2025

Calculator

Status: Open.

#471 In AllAlgorithms/c;

· Siddharth090105 opened on Feb 3, 2025

Calculator

Status: Open.

#470 In AllAlgorithms/c;

· Geethesh12 opened on Feb 3, 2025

Calculator

Status: Open.

#469 In AllAlgorithms/c;

· Vikash130704 opened on Feb 3, 2025

Simple calculator

Status: Open.

#468 In AllAlgorithms/c;

· ShaikMoneesha opened on Feb 3, 2025

Calculator program

Status: Open.

#467 In AllAlgorithms/c;

· Hematirukala opened on Feb 3, 2025

Calculator program

Status: Open.

#466 In AllAlgorithms/c;

· Hematirukala opened on Feb 3, 2025

#include <stdio.h> #include <limits.h> long long second_larg_ele(int size, long long arr[]) { if (size < 2) { return -1; // Return -1 if there is no second largest element } long long largest = LLONG_MIN; long long second_largest = LLONG_MIN; for (int i = 0; i < size; i++) { if (arr[i] > largest) { second_largest = largest; largest = arr[i]; } else if (arr[i] > second_largest && arr[i] < largest) { second_largest = arr[i]; } } return (second_largest == LLONG_MIN) ? -1 : second_largest; } // Example usage int main() { int size1 = 8; long long arr1[] = {20, 30, 50, 60, 70, 10, 11, 25}; printf("%lld\n", second_larg_ele(size1, arr1)); // Output: 60 int size2 = 5; long long arr2[] = {1, 2, 3, 4, 5}; printf("%lld\n", second_larg_ele(size2, arr2)); // Output: 4 return 0; }

Status: Open.

#465 In AllAlgorithms/c;

· Hematirukala opened on Feb 3, 2025