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 aray 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 215 9 8 the output is: 3 2 159 8 2 3 159 8 1 2 359 8 1 2 3 59 8 1 2 3 59 8 1 2 3589 comparisons: 7 swaps: 4
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 aray 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 215 9 8 the output is: 3 2 159 8 2 3 159 8 1 2 359 8 1 2 3 59 8 1 2 3 59 8 1 2 3589 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
Related questions
Question
My need help with this code. The code template pasted below.
![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)
Ex: When the input is:
6 3 2 1
5 9 8
the output is:
3 2 1 59 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](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F722c0934-aff7-4600-989e-1d198e6697ab%2F6134ccde-7b24-4363-85d4-8eaaaec2bdf2%2Fvd8hznl_processed.jpeg&w=3840&q=75)
Transcribed Image Text: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)
Ex: When the input is:
6 3 2 1
5 9 8
the output is:
3 2 1 59 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
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 1 images
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.Recommended textbooks for you
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education