20.12 LAB: Insertion sort 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 8the 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 1 import java.util.Scanner;3 public class LabProgram {L23&SON4567891011121314151617181920212223248222272526 }353637383940 41 42 43 44 45// Read and return an array of integers.45// The first integer read is number of integers that follow.private static int[] readNums() {Scanner scnr = new Scanner(System.in);int size= scnr.nextInt();int[] numbers = new int[size];for (int i}numbers[i]}}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 i0; i 0 && numbers [j] < numbers [j - 1]) { ≥ 1 2 3 44 45404142434647484950515253545556575859606162636465666768}69}for (i 1; i < numbers.length; ++i) {j = i;// Insert numbers[i] into sorted part,// stopping once numbers[i] is in correct positionwhile (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 arrayint[] numbers readNums();=// Step 2: Output the numbers arrayprintNums(numbers);System.out.println();// Step 3: Sort the numbers arrayinsertionSort(numbers);System.out.println();// step 4/* TODO: Output the number of comparisons and swaps performed *,}

SOLUTION- I have solved this problem in Java code with comments and screenshot for easy…

20.12 LAB: Insertion sort 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

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

20.12 LAB: Insertion sort

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

1 import java.util.Scanner;
3 public class LabProgram {
L23&SON
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
8222
27
25
26 }
35
36
37
38
39
40 41 42 43 44 45
// Read and return an array of integers.
45
// The first integer read is number of integers that follow.
private static int[] readNums() {
Scanner scnr = new Scanner(System.in);
int size= scnr.nextInt();
int[] numbers = new int[size];
for (int i
}
numbers[i]
}
}
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(" ");
}
=
// Exchange nums [j] and nums [k].
29 private static void swap(int[] nums, int j, int k) {
30
31
32
33
34
int temp
nums [j]
nums [k]
System.out.println();
int i;
int j;
0; i < size; ++i) {
scnr.nextInt ();
=
for (i
=
LabProgram.java
=
= nums [j];
nums [k];
temp;
// Read array size
// Create array
// Read the numbers
// Sort numbers
/* TODO: Count comparisons and swaps. Output the array at the end of each iteration. */
public static void insertionSort(int[] numbers) {
1; i < numbers.length; ++i) {
Load default template...
j i;
// Insert numbers[i] into sorted part,
// stopping once numbers[i] is in correct position
while (j> 0 && numbers [j] < numbers [j - 1]) {

≥ 1 2 3 44 45
40
41
42
43
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68}
69
}
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 *,
}

Expert Solution

Trending now

This is a popular solution!

Step by step

Solved in 4 steps with 3 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.