// [10,30,15,4,2,5] // when you get element< smallest //interchange second_smallest <-> smallest //smallest= element //else if u get element< second_smallest //if element != smallest then //second_smallest= element //find neat code below long min=Integer.MAX_VALUE; long sMin= Integer.MAX_VALUE; for(int i=0; i<n; i++){ if(a[i]< min){ sMin=min; min= a[i]; } else if(a[i]<sMin && a[i]!= min){ sMin= a[i]; } } 

/* C program to print second largest element of the array*/
//Save it as SecondLargestElementArray.c
#include<stdio.h>
#include<limits.h>
int main(){ int i,n; printf("Enter the size of array : "); scanf("%d",&n); //Declaring array int arr[n]; printf("Enter the elements of the array : "); for(i=0;i<n;i++) { scanf("%d",&arr[i]); } //Declaring maximum element int maximum = INT_MIN; //Comparing with each element and find maximum element for(i=0;i<n;i++) { if(arr[i] > maximum) { maximum = arr[i]; } } printf("The maximum value is : %d", maximum); int second_max = INT_MIN; //Finding Second largest element. //Comparing with each element and also checking it is not equal to max for(i=0;i<n;i++) { if(arr[i] > second_max && arr[i]!=maximum) { second_max = arr[i]; } } printf("\nThe second maximum value is : %d", second_max);
}
Input:
Enter the size of array :
6
Enter the elements of the array :
4 3 8 0 8 7
Output:
The maximum value is : 8
The second maximum value is : 7

// Java program to find second largest
// element in an array
import java.util.*;
class GFG{
// Function to print the
// second largest elements
static void print2largest(int arr[], int arr_size)
{ int i, first, second; // There should be // atleast two elements if (arr_size < 2) { System.out.printf(" Invalid Input "); return; } // Sort the array Arrays.sort(arr); // Start from second last element // as the largest element is at last for (i = arr_size - 2; i >= 0; i--) { // If the element is not // equal to largest element if (arr[i] != arr[arr_size - 1]) { System.out.printf("The second largest " + "element is %d\n", arr[i]); return; } } System.out.printf("There is no second " + "largest element\n");
}
// Driver code
public static void main(String[] args)
{ int arr[] = {12, 35, 1, 10, 34, 1}; int n = arr.length; print2largest(arr, n);
}
}
// This code is contributed by gauravrajput1

public static void main() { a1(new int[]{1, 2, 3, 4}); a1(new int[]{4, 1, 2, 3}); a1(new int[]{1, 1, 2, 2}); a1(new int[]{1, 1}); a1(new int[]{1}); a1(new int[]{}); } static int a1(int[] a) { int max1 = -1; int max2 = -1; for (int i=0; i<a.length; i++) { if (a[i] > max1) { max2 = max1; max1 = a[i]; } else if (a[i] != max1 && a[i] > max2) max2 = a[i]; } return max2; }

// Java program to find second largest
// element in an array
import java.util.*;
class GFG{
 
// Function to print the
// second largest elements
static void print2largest(int arr[],
                          int arr_size)
{
  int i, first, second;
 
  // There should be
  // atleast two elements
  if (arr_size < 2)
  {
    System.out.printf(" Invalid Input ");
    return;
  }
 
  // Sort the array
  Arrays.sort(arr);
 
  // Start from second last element
  // as the largest element is at last
  for (i = arr_size - 2; i >= 0; i--)
  {
    // If the element is not
    // equal to largest element
    if (arr[i] != arr[arr_size - 1])
    {
      System.out.printf("The second largest " +
                        "element is %d\n", arr[i]);
      return;
    }
  }
 
  System.out.printf("There is no second " +
                    "largest element\n");
}
 
// Driver code
public static void main(String[] args)
{
  int arr[] = {12, 35, 1, 10, 34, 1};
  int n = arr.length;
  print2largest(arr, n);
}
}
 
// This code is contributed by gauravrajput1