w3resource
Java Programming Exercies

Java Exercises: 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.

Pictorial Presentation:

Java Basic Exercises: Find the k smallest elements in a given array.

Sample Solution:

Java Code:

import java.util.*;
public class Solution {
	
    public static void main(String[] args) 
    {
        Integer arr[] = new Integer[]{1, 4, 17, 7, 25, 3, 100};
  int k = 3;
  System.out.println("Original Array: ");
  System.out.println(Arrays.toString(arr));
  System.out.println(k + " smallest elements of the said array are:");
  Arrays.sort(arr);
  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:

Flowchart: Java exercises: Find the k smallest elements in a specified array.

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?



New Content: Composer: Dependency manager for PHP, R Programming