21.12 LAB: Insertion sort The script has four steps: 1. Read a list of integers (no duplicates). 2. Output the numbers in the list. 3. Perform an insertion sort on the list. 4. Output the number of comparisons and swaps performed during the insertion sort. Steps 1 and 2 are provided in the script. Implement step 3 based on the insertion sort algorithm in the book. Modify insertion_sort() to: • Count the number of comparisons performed. Count the number of swaps performed. Output the list during each iteration of the outside loop. Implement step 4 at the end of the script. Hints: In order to count comparisons and swaps, modify the while loop in insertion_sart(). Use global variables for comparisons and swaps The script includes three helper functions: • read_nums() # Read and return a list of integers. • print_nums(nums) # Output the numbers in nums swap(nums, n, m) # Exchange nums[n] and nums[m]
21.12 LAB: Insertion sort The script has four steps: 1. Read a list of integers (no duplicates). 2. Output the numbers in the list. 3. Perform an insertion sort on the list. 4. Output the number of comparisons and swaps performed during the insertion sort. Steps 1 and 2 are provided in the script. Implement step 3 based on the insertion sort algorithm in the book. Modify insertion_sort() to: • Count the number of comparisons performed. Count the number of swaps performed. Output the list during each iteration of the outside loop. Implement step 4 at the end of the script. Hints: In order to count comparisons and swaps, modify the while loop in insertion_sart(). Use global variables for comparisons and swaps The script includes three helper functions: • read_nums() # Read and return a list of integers. • print_nums(nums) # Output the numbers in nums swap(nums, n, m) # Exchange nums[n] and nums[m]
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
Python
![21.12 LAB: Insertion sort
The script has four steps:
1. Read a list of integers (no duplicates).
2. Output the numbers in the list.
3. Perform an insertion sort on the list.
4. Output the number of comparisons and swaps performed during the insertion sort.
Steps 1 and 2 are provided in the script.
Implement step 3 based on the insertion sort algorithm in the book. Modify insertion_sort) to:
Count the number of comparisons performed.
Count the number of swaps performed.
Output the list during each iteration of the outside loop.
Implement step 4 at the end of the script.
Hints: In order to count comparisons and swaps, modify the while loop in insertion_sort(). Use global variables for comparisons and swaps.
The script includes three helper functions:
read_nums() # Read and return a list of integers.
print_nums(nums) # Output the numbers
swap(nums, n, m) # Exchange nums[n] and nums[m]
nums
Ex: When the input is:
3 2 1598
the output is:
3 215 9 8
2315 9 8
1 235 98
1 235 98
1 2 3598
1235 89
comparisons: 7
swaps: 4](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F6046cbb1-e308-4521-9255-72f2b16e119a%2F95729f65-fab6-41ad-947c-5ec11ca14744%2F59vpn7p_processed.jpeg&w=3840&q=75)
Transcribed Image Text:21.12 LAB: Insertion sort
The script has four steps:
1. Read a list of integers (no duplicates).
2. Output the numbers in the list.
3. Perform an insertion sort on the list.
4. Output the number of comparisons and swaps performed during the insertion sort.
Steps 1 and 2 are provided in the script.
Implement step 3 based on the insertion sort algorithm in the book. Modify insertion_sort) to:
Count the number of comparisons performed.
Count the number of swaps performed.
Output the list during each iteration of the outside loop.
Implement step 4 at the end of the script.
Hints: In order to count comparisons and swaps, modify the while loop in insertion_sort(). Use global variables for comparisons and swaps.
The script includes three helper functions:
read_nums() # Read and return a list of integers.
print_nums(nums) # Output the numbers
swap(nums, n, m) # Exchange nums[n] and nums[m]
nums
Ex: When the input is:
3 2 1598
the output is:
3 215 9 8
2315 9 8
1 235 98
1 235 98
1 2 3598
1235 89
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 3 steps with 2 images
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY