Java: Find the k largest elements in a specified array

Last update on March 10 2025 12:22:25 (UTC/GMT +8 hours)

Find K Largest Elements

Write a Java program to find the k largest elements in a given array. Elements in the array can be in any order.

Visual Presentation:

Sample Solution:

Java Code:

import java.util.*;

public class Solution {
    public static void main(String[] args) {
        // Initializing an array of integers
        Integer arr[] = new Integer[]{1, 4, 17, 7, 25, 3, 100};
        
        int k = 3; // Initializing the value of 'k' as 3
        
        // Displaying the original array
        System.out.println("Original Array: ");
        System.out.println(Arrays.toString(arr));
        
        // Displaying the k largest elements of the array
        System.out.println(k + " largest elements of the said array are:");
        
        // Sorting the array in reverse order using Collections.reverseOrder()
        Arrays.sort(arr, Collections.reverseOrder());
        
        // Printing the k largest elements from the sorted array
        for (int i = 0; i < k; i++) {
            System.out.print(arr[i] + " ");
        }
    }
} 

Sample Output:

Original Array: 
[1, 4, 17, 7, 25, 3, 100]
3 largest elements of the said array are:
100 25 17 

Flowchart:

For more Practice: Solve these Related Problems:

• Write a Java program to find the k largest unique elements in an array containing duplicate values.
• Write a Java program to determine the kth largest element in an unsorted array using a min-heap approach.
• Write a Java program to process a stream of integers and maintain the k largest elements seen so far.
• Write a Java program to find the k largest elements in an array using the quickselect algorithm.

Java Code Editor:

Contribute your code and comments through Disqus.

Previous: Write a Java program to create a two-dimension array (m x m) A[][] such that A[i][j] is true if I and j are prime and have no common factors, otherwise A[i][j] becomes false.
Next: Write a Java program to find the k smallest elements in a given array. Elements in the array can be in any order.