I have certain that the result is ok.... try the code.. I only used a treeSet to sort automatically.
package com.codegym.task.task06.task0622;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.lang.reflect.Array;
import java.util.*;
/*
Ascending numbers
*/
public class Solution {
public static void main(String[] args) throws Exception {
BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
Integer[] numbers = new Integer[5];
int j = 0;
//write your code here
for (int i = 0; i < numbers.length; i++) {
numbers[i] = Integer.parseInt(reader.readLine());
}
for (Object number : ascending(numbers)){
j++;
if (j == 5)
System.out.print((int)number);
else
System.out.println((int)number);
}
}
public static Collection ascending(Integer[] list){
Collection integers = new TreeSet<Integer>();
Collections.addAll(integers, list);
return integers;
}
}