Python code pls! 14.9 LAB: Insertion sort The script has four steps: Read a list of integers (no duplicates). Output the numbers in the list. Perform an insertion sort on the list. 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 in nums swap(nums, n, m) # Exchange nums[n] and nums[m] Code that I need to modify(this is the given format, and I have to edit it following the #directions): def read_nums(): """Read numbers from input and return them in a list""" return [int(num) for num in input().split()] def print_nums(nums): """Output numbers, separating each item by a spaces; no space or newline before the first number or after the last.""" print(' '.join([str(n) for n in nums]), end='') def swap(nums, n, m): """Exchange nums[n] and nums[m]""" nums[n], nums[m] = nums[m], nums[n] def insertion_sort(numbers): """Sort the list numbers using insertion sort""" # TODO: Count comparisons and swaps. Output the array at the end of each iteration. for i in range(1, len(numbers)): j = i # Insert numbers[i] into sorted part # stopping once numbers[i] is in correct position while j > 0 and numbers[j] < numbers[j - 1]: swap(numbers, j, j - 1) j -= 1 if __name__ == '__main__': # Step 1: Read numbers into a list numbers = read_nums() # Step 2: Output the numbers list print_nums(numbers); print(end='\n\n') # Step 3: Sort the numbers list insertion_sort(numbers) print() # Step 4: TODO: Output the number of comparisons and swaps performed
Python code pls!
14.9 LAB: Insertion sort
The script has four steps:
- Read a list of integers (no duplicates).
- Output the numbers in the list.
- Perform an insertion sort on the list.
- 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
- 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 in nums
- swap(nums, n, m) # Exchange nums[n] and nums[m]
Code that I need to modify(this is the given format, and I have to edit it following the #directions):
def read_nums():
"""Read numbers from input and return them in a list"""
return [int(num) for num in input().split()]
def print_nums(nums):
"""Output numbers, separating each item by a spaces;
no space or newline before the first number or after the last."""
print(' '.join([str(n) for n in nums]), end='')
def swap(nums, n, m):
"""Exchange nums[n] and nums[m]"""
nums[n], nums[m] = nums[m], nums[n]
def insertion_sort(numbers):
"""Sort the list numbers using insertion sort"""
# TODO: Count comparisons and swaps. Output the array at the end of each iteration.
for i in range(1, len(numbers)):
j = i
# Insert numbers[i] into sorted part
# stopping once numbers[i] is in correct position
while j > 0 and numbers[j] < numbers[j - 1]:
swap(numbers, j, j - 1)
j -= 1
if __name__ == '__main__':
# Step 1: Read numbers into a list
numbers = read_nums()
# Step 2: Output the numbers list
print_nums(numbers);
print(end='\n\n')
# Step 3: Sort the numbers list
insertion_sort(numbers)
print()
# Step 4: TODO: Output the number of comparisons and swaps performed
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 2 images
I have the exact same code as you have provided, with the indentation, but it is giving me this error right now.
by Bartleby Expert
