Wanna help

Question about the task

Task about algorithms

Java Syntax, Level 10, Lesson 11

Resolved

Read 30 numbers from the keyboard. Display the 10th and 11th smallest numbers.

Explanation:

The lowest number is the 1st smallest.
The next lowest after that is the 2nd smallest

For example:
1 6 5 7 1 15 63 88 The first smallest is 1 The second smallest is 1 The third smallest is 5 The fourth smallest is 6

Requirements:

The program must read data from the keyboard.
The program should display text on the screen.
The Solution class must have two methods.
The sort() method must sort an array of elements.
The main() method should call the sort() method.
The program should display the 10th and 11th smallest numbers. Each value should be on a new line.

package com.codegym.task.task10.task1020; import java.io.BufferedReader; import java.io.InputStreamReader; /* Task about algorithms */ public class Solution { public static void main(String[] args) throws Exception { BufferedReader reader = new BufferedReader(new InputStreamReader(System.in)); int[] array = new int[30]; for (int i = 0; i < 30; i++) { array[i] = Integer.parseInt(reader.readLine()); } sort(array); System.out.println(array[9]); System.out.println(array[10]); } public static void sort(int[] array) { for (int i = 1 ; i < array.length ; i++){ int indexOfMin = i; for (int j = i + 1 ; j < array.length ; j++){ if (array[indexOfMin] > array[j]){ indexOfMin = j; } } int temp = array[indexOfMin]; array[indexOfMin] = array[i]; array[i] = temp; } } }

Comments (1)

Popular
New
Old

You must be signed in to leave a comment

Sergio

Level 25 , Moscow, Russian Federation

8 May 2019, 11:10

solution

See the line 26. The initial value for i must be 0, and last index to check is:

i < array.length - 1