# Java: Find the k largest elements in a specified array

## Java Basic: Exercise-159 with Solution

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: **

**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.

**What is the difficulty level of this exercise?**

Test your Programming skills with w3resource's quiz.

**Weekly Trends and Language Statistics**- Weekly Trends and Language Statistics