Курсова Работа 2 - 3.5 Selection sort

import java.util.Arrays;
import java.util.Scanner;

public class Tri_Pet {

    static void sort(int arr[]) {
        int n = arr.length;
        for (int i = 0; i < n - 1; i++) {
            int min_idx = i;
            for (int j = i + 1; j < n; j++)
                if (arr[j] < arr[min_idx])
                    min_idx = j;
            int temp = arr[min_idx];
            arr[min_idx] = arr[i];
            arr[i] = temp;
        }
    }
    static void printArray(int arr[]) {
        int n = arr.length;
        for (int i = 0; i < n; ++i)
            System.out.print(arr[i] + " ");
        System.out.println();
    }

    public static void main(String args[]) {
        Scanner sc = new Scanner(System.in);
        String[] input = sc.nextLine().split(" ");
        int[] numbers = new int[input.length];
        for (int i = 0; i < numbers.length; i++) {
            numbers[i] = Integer.parseInt(input[i]);
        }
        System.out.println("Array before sorting: ");
        System.out.println(Arrays.toString(numbers));
        System.out.println();
        sort(numbers);
        System.out.println("Array after sorting: ");
        System.out.println(Arrays.toString(numbers));
    }
}