Java Program to find Second Largest Number in an Array

We can find the second largest number in an array in java by sorting the array and returning the 2nd largest number. Let's see the full example to find the second largest number in java array.

Output:

Second Largest: 5
Second Largest: 77

Find 2nd Largest Number in Array using Arrays

Let's see another example to get second largest element or number in java array using collections.

Output:

Second Largest: 5
Second Largest: 77

Find 2nd Largest Number in Array using Collections

Let's see another example to get second largest number in java array using collections.

Output:

Second Largest: 5
Second Largest: 77

Java Program to find Second Largest Number in an Array MCQ

1. What is the time complexity of finding the second largest number in an array using sorting?

1. O(n)
2. O(n log n)
3. O(n^2)
4. O(1)

2. Which approach is NOT suitable for finding the second largest number in an array?

1. Sorting the array and accessing the second last element
2. Using a single pass to find the maximum and then another pass to find the second maximum
3. Using a heap data structure
4. Using a counter array for frequency calculation

3. What is an advantage of using a single-pass algorithm to find the second largest number compared to sorting?

1. It guarantees O(1) time complexity
2. It requires less additional space
3. It always finds the largest number as well
4. It is easier to implement

4. When is using a heap data structure most beneficial for finding the second largest number in an array?

1. When the array is already sorted
2. When the array size is small
3. When the array elements are randomly ordered
4. When the array contains duplicate elements

5. Which Java collection is NOT suitable for finding the second largest number directly in an array?

1. TreeSet
2. LinkedList
3. PriorityQueue
4. HashMap