Java: Find the k smallest elements in a specified array

Last update on May 13 2025 12:58:43 (UTC/GMT +8 hours)

Find K Smallest Elements

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:

For more Practice: Solve these Related Problems:

• Write a Java program to extract the k smallest unique elements from an array containing duplicates.
• Write a Java program to determine the kth smallest element in an unsorted array using a max-heap.
• Write a Java program to find the k smallest elements in a matrix that is sorted both row-wise and column-wise.
• Write a Java program to implement the quickselect algorithm to find the k smallest elements in an array.

Go to:

• Java Basic Part-II Programming Exercises Home ↩
• Java Exercises Home ↩

PREV : Find K Largest Elements.
NEXT : Kth Smallest and Largest.

Java Code Editor:

Contribute your code and comments through Disqus.