Michael Kurniawan 1910403011 University of Cincinnati Assignment 3  Perform Selection Sort in Descending Order We must significantly alter the standard selection sort algorithm in order to execute selection sort in descending order. the following steps: 1. Using an index i between 0 and n-1, loop over the full array. 2. Set the highest possible value (max) to the current index (i). 3. Use index j to iterate through the remaining elements of the array from i+1 to n. 4. Set the highest value to the existing index j if the quantity at index j exceeds the amount at index max. 5. Swap the index i value for the index max value. 6. Till every item in the array is arranged in descending order, repeat steps 1 through 5. The following Python code demonstrates how to do a selection sort in descending order: The array that has to be sorted in descending order is passed to the “selection_sort_descending()” method as an input parameter in the code above. As previously said, this method uses selection sort and returns the array sorted in decreasing order.  The Process of Performing Insertion Sort in Descending Order Insertion sort in ascending order is accomplished similarly to insertion sort in descending order, with a few changes. the following steps: 1. 2. 3. 4. Using an index i between 1 and n-1, loop over the full array. To the value at the current index, i, set the key value to that value. From i-1 to 0, iterate through the array with an index of j. Move the value at index j to index j+1 if the value there is smaller than the key value. 5. 6. 7. Exit the loop if the value at index j is higher than or equal to the key value. Put the key value at position j+1. Until the entire array is arranged in descending order, repeat steps 1-6. The following Python code demonstrates how to insert sort in descending order: The "insertion_sort_descending()" method in the code above takes an array as an input parameter and sorts it in descending order. The sorted array is returned by this method in descending order after doing the insertion sort as previously described.

New Documents from this Course

Algorithm to Sort the Array Using the Quicksort Algorithm

University of Cincinnati Blue Ash CS101 | Basic Algoritms and Programming

Assignment

Details

Description

Related Documents

Struggling with your assignment and deadlines?

Free up your schedule!

Take 5 seconds to unlock