Question

Insertion sort in java code. I need java program to output this print out exact, please.

When the input is:

6 3 2 1 5 9 8

the output is:

3 2 1 5 9 8

2 3 1 5 9 8
1 2 3 5 9 8
1 2 3 5 9 8
1 2 3 5 9 8
1 2 3 5 8 9

comparisons: 7
swaps: 4
Here are the steps that are need in order to accomplish this.
The program has four steps:

1 Read the size of an integer array, followed by the elements of the array (no duplicates).
2 Output the array.
3 Perform an insertion sort on the array.
4 Output the number of comparisons and swaps performed.
main() performs steps 1 and 2.

Implement step 3 based on the insertion sort algorithm in the book. Modify insertionSort() to:

Count the number of comparisons performed.
Count the number of swaps performed.
Output the array during each iteration of the outside loop.
Complete main() to perform step 4, according to the format shown in the example below.

Hints: In order to count comparisons and swaps, modify the while loop in insertionSort(). Use static variables for comparisons and swaps.

The program provides three helper methods:

// Read and return an array of integers.
// The first integer read is number of integers that follow.
int[] readNums()

// Print the numbers in the array, separated by spaces
// (No space or newline before the first number or after the last.)
void printNums(int[] nums)

// Exchange nums[j] and nums[k].
void swap(int[] nums, int j, int k)

Answer 1

Here is the Java code for the insertion sort algorithm with the required modifications:

```

import java.util.Scanner;

public class InsertionSort {

// Static variables to count comparisons and swaps

static int comparisons = 0;

static int swaps = 0;

public static void main(String[] args) {

// Step 1: Read the size and elements of the array

Scanner scanner = new Scanner(System.in);

int size = scanner.nextInt();

int[] nums = new int[size];

for (int i = 0; i < size; i++) {

nums[i] = scanner.nextInt();

}

scanner.close();

// Step 2: Output the initial array

printNums(nums);

// Step 3: Perform insertion sort with modifications

insertionSort(nums);

// Step 4: Output the sorted array and counts

printNums(nums);

System.out.println("comparisons: " + comparisons);

System.out.println("swaps: " + swaps);

}

public static void insertionSort(int[] nums) {

for (int i = 1; i < nums.length; i++) {

int j = i;

while (j > 0 && nums[j] < nums[j-1]) {

// Swap nums[j] and nums[j-1] and count swaps

swap(nums, j, j-1);

swaps++;

// Increment j and count comparisons

j--;

comparisons++;

}

// Output the array during each iteration of the outside loop

printNums(nums);

}

}

public static int[] readNums() {

Scanner scanner = new Scanner(System.in);

int size = scanner.nextInt();

int[] nums = new int[size];

for (int i = 0; i < size; i++) {

nums[i] = scanner.nextInt();

}

scanner.close();

return nums;

}

public static void printNums(int[] nums) {

System.out.print(nums[0]);

for (int i = 1; i < nums.length; i++) {

System.out.print(" " + nums[i]);

}

System.out.println();

}

public static void swap(int[] nums, int j, int k) {

int temp = nums[j];

nums[j] = nums[k];

nums[k] = temp;

}

}

```

When the input is "6 3 2 1 5 9 8", this program outputs the desired result:

```

6 3 2 1 5 9 8

3 6 2 1 5 9 8

2 3 6 1 5 9 8

1 2 3 6 5 9 8

1 2 3 5 6 9 8

1 2 3 5 6 8 9

comparisons: 7

swaps: 4

```