Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- import java.util.Scanner;
- class Task9_6_3 {
- public static void main(String[] args) {
- Scanner sc = new Scanner(System.in);
- int n = sc.nextInt();
- int[] numArr = new int[n];
- for (int i = 0; i < n; i++) {
- numArr[i] = sc.nextInt();
- }
- insertionSort(numArr, n);
- }
- public static void insertionSort(int[] a, int n) {
- int in, out;
- for (out = 1; out < n; out++){
- int temp = a[out];
- in = out;
- while (in > 0 && a[in-1] >= temp) {
- a[in] = a[in - 1];
- --in;
- }
- a[in] = temp;
- }
- for (int i = 0; i < n; i++) {
- System.out.print(a[i] + " ");
- }
- }
- }
Add Comment
Please, Sign In to add comment