solve in python coding 3. Selection Sort • The idea in a selection sort is that you locate the largest item out of a set of unsorted items, and move it into position at the end of the unsorted items. A sorted region grows one item at a time, while an unsorted region shrinks. • As done in Part 1, fill an array with random numbers. • Write a function that locates the largest element in the portion of the array beginning at the start of the array, up to a given index, and swaps the largest item with the item at the given index. • E.g. If searching a[0] to a[7] locates the largest item at a[4], a[4] and a[7] would be swapped. • Write a second function that calls the first function repeatedly, until the entire array is sorted. (Each time the first function is called, it will search one fewer element)
solve in python coding
3. Selection Sort
• The idea in a selection sort is that you locate the largest item out of a set of
unsorted items, and move it into position at the end of the unsorted items. A
sorted region grows one item at a time, while an unsorted region shrinks.
• As done in Part 1, fill an array with random numbers.
• Write a function that locates the largest element in the portion of the array
beginning at the start of the array, up to a given index, and swaps the largest
item with the item at the given index.
• E.g. If searching a[0] to a[7] locates the largest item at a[4], a[4] and a[7] would be
swapped.
• Write a second function that calls the first function repeatedly, until the entire
array is sorted. (Each time the first function is called, it will search one fewer
element)
Step by step
Solved in 2 steps with 1 images
