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

## Java Basic: Exercise-160 with Solution

Write a Java program to find the k smallest 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 smallest elements of the array
System.out.println(k + " smallest elements of the said array are:");
// Sorting the array in ascending order
Arrays.sort(arr);
// Printing the k smallest 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 smallest elements of the said array are: 1 3 4

**Flowchart: **

**Java Code Editor:**

** Contribute your code and comments through Disqus.**

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

**Next:** Write a Java program to find the kth smallest and largest element 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