Insertion sort in java code need output need to print exact. Make sure to give explanation and provide output.My output is printing the wrong comparison. The output it is printing is comarison: 9 and what I need it to output to print the comparisons: 7.

The program has four steps:

Read the size of an integer array, followed by the elements of the array (no duplicates).

Output the array.

Perform an insertion sort on the array.

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)

Ex: 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

Put your java code into the java program,putting in the to do list.

import java.util.Scanner;

public class LabProgram {

// Read and return an array of integers.

// The first integer read is number of integers that follow.

private static int[] readNums() {

Scanner scnr = new Scanner(System.in);

int size = scnr.nextInt(); // Read array size

int[] numbers = new int[size]; // Create array

for (int i = 0; i < size; ++i) { // Read the numbers

numbers[i] = scnr.nextInt();

}

return numbers;

}

// Print the numbers in the array, separated by spaces

// (No space or newline before the first number or after the last.)

private static void printNums(int[] nums) {

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

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

if (i < nums.length - 1) {

System.out.print(" ");

}

}

System.out.println();

}

// Exchange nums[j] and nums[k].

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

int temp = nums[j];

nums[j] = nums[k];

nums[k] = temp;

}

// Sort numbers

/* TODO: Count comparisons and swaps. Output the array at the end of each iteration. /

public static void insertionSort(int[] numbers) {

int i;

int j;

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

j = i;

// Insert numbers[i] into sorted part,

// stopping once numbers[i] is in correct position

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

// Swap numbers[j] and numbers[j - 1]

swap(numbers, j, j - 1);

--j;

}

}

}

public static void main(String[] args) {

// Step 1: Read numbers into an array

int[] numbers = readNums();

// Step 2: Output the numbers array

printNums(numbers);

System.out.println();

// Step 3: Sort the numbers array

insertionSort(numbers);

System.out.println();

// step 4

/ TODO: Output the number of comparisons and swaps performed*/

}

}

Question

Insertion sort in java code need output need to print exact. Make sure to give explanation and provide output.My output is printing the wrong comparison. The output it is printing is comarison: 9 and what I need it to output to print the comparisons: 7.

The program has four steps:

Read the size of an integer array, followed by the elements of the array (no duplicates).

Output the array.

Perform an insertion sort on the array.

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)

Ex: 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

Put your java code into the java program,putting in the to do list.

import java.util.Scanner;

public class LabProgram {

// Read and return an array of integers.

// The first integer read is number of integers that follow.

private static int[] readNums() {

Scanner scnr = new Scanner(System.in);

int size = scnr.nextInt(); // Read array size

int[] numbers = new int[size]; // Create array

for (int i = 0; i < size; ++i) { // Read the numbers

numbers[i] = scnr.nextInt();

}

return numbers;

}

// Print the numbers in the array, separated by spaces

// (No space or newline before the first number or after the last.)

private static void printNums(int[] nums) {

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

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

if (i < nums.length - 1) {

System.out.print(" ");

}

}

System.out.println();

}

// Exchange nums[j] and nums[k].

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

int temp = nums[j];

nums[j] = nums[k];

nums[k] = temp;

}

// Sort numbers

/* TODO: Count comparisons and swaps. Output the array at the end of each iteration. */

public static void insertionSort(int[] numbers) {

int i;

int j;

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

j = i;

// Insert numbers[i] into sorted part,

// stopping once numbers[i] is in correct position

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

// Swap numbers[j] and numbers[j - 1]

swap(numbers, j, j - 1);

--j;

}

}

}

public static void main(String[] args) {

// Step 1: Read numbers into an array

int[] numbers = readNums();

// Step 2: Output the numbers array

printNums(numbers);

System.out.println();

// Step 3: Sort the numbers array

insertionSort(numbers);

System.out.println();

// step 4

/* TODO: Output the number of comparisons and swaps performed*/

}

}

uchamplin · Accepted Answer

The insertion sort algorithm involves sorting an array by individually considering and placing each element.What is the Insertion sort about? To apply insertion sort, one should choose an element and then search for its suitable location within the ordered array. The mechanism of Insertion Sort is akin to the way a deck of cards is sorted.The term insertion order pertains to the sequence of adding components to a data structure, such as a collection such as List, Set, Map, and so on. A List object retains the sequence in which elements are added, but a Set object does not uphold the sequence of the elements when inserted.Learn more about Insertion sort fromhttps://brainly.com/question/13326461#SPJ1

Answers

Related Questions

Answers

Answers

Answers

Answers

Answers

Answers

Answers

Answers

Answers

Answers

Answers

Answers

Answers

Answers

Answers

Answers

Answers

Answers

Answers