How do you find the second largest number in an array?

Question

Accepted Answer

public class Main{

public static void merge(int[] arr, int beg, int mid, int end){

int l1 = mid-beg+1; //length of left array

int l2 = end-mid; //length of right array

int[] leftArray = new int[l1]; //create left array

int[] rigthArray = new int[l2]; //create right array

for(int i=0; i

leftArray[i] = arr[beg+i];

}

for(int j=0; j

rigthArray[j] = arr[mid+1+j];

}

int i=0; //pointing to left array

int j=0; //pointing to right array

int k=beg; //pointing to arr

while(i

if(leftArray[i] < rigthArray[j]){

arr[k++] = leftArray[i++];

}else{

arr[k++] = rigthArray[j++];

}

while(i

arr[k++] = leftArray[i++];

}

while(j

arr[k++] = rigthArray[j++];

}

public static void mergeSort(int[] arr, int beg, int end){

if(beg

int mid = (beg+end)/2; //formula to find out mid element

mergeSort(arr, beg, mid); //for left array sort

mergeSort(arr, mid+1, end); //for right array sort

merge(arr, beg, mid, end); //merge both sorting array

}

public static void secondLargest(int[] arr){

mergeSort(arr, 0, arr.length-1); //first sorting the array

System.out.print(arr.length-2); //then printing second largest element

}

public static void main(String[] args){

int[] arr = {2,4,3,6,5,8,7,6,1,9};

System.out.println();

secondLargest(arr);

}

Accepted Answer

Sort the array using any sorting technique with less time complexity then print the (arr.length-2)th element from array.

Asked in ivy

How do you find the second largest number in an array?

Top Software Engineer Interview Questions Asked at ivy

Interview Questions Asked to Software Engineer at Other Companies

Top Skill-Based Questions for ivy Software Engineer