Insertion Sort

/*
 * Problem : Sort an array in ascending order.
 * Input   : n, then n integers.
 * Output  : The sorted array.
 * Approach: Insert into the sorted part.
 * Time    : O(n^2)
 * Space   : O(1)
 * Java    : 8 or newer.
 */
import java.util.Scanner;
import java.util.Arrays;
import java.util.stream.Collectors;

public class Main {
    // This method solves the task. It receives the input and returns the answer.
    static int[] solve(int[] a) {
        // Step 1: The part to the left of index i is already sorted. The first element alone is sorted.
        for (int i = 1; i < a.length; i++) {
            // Step 2: Take the next value. It must be inserted into the sorted part.
            int value = a[i];
            int j = i - 1;

            // Step 3: Shift bigger values one place to the right.
            while (j >= 0 && a[j] > value) {
                a[j + 1] = a[j];
                j--;
            }

            // Step 4: Put the value in the free place.
            a[j + 1] = value;
        }
        return a;
    }

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int size = scanner.nextInt();
        int[] a = new int[size];
        for (int i = 0; i < size; i++) {
            a[i] = scanner.nextInt();
        }
        System.out.println(Arrays.stream(solve(a)).mapToObj(String::valueOf).collect(Collectors.joining(" ")));
    }
}