CSC122F2021HomeSort < CenterForComputing

Tags: view all tags
---+Sorting and Searching homework
Due date given in class<br>
To be handed in via hard copy on the date specified<br>
---++Data set to use for sorting each question
65, 34, 27, 84, 92, 54, 82, 15, 75, 49, 50, 21
   1. Sort via the selection sort.  Show your work after each pass through the "outer loop".  Include passes that due nothing.
   1. Sort via the insertion sort.  Show your work after each pass through the "outer loop".  Include passes that due nothing.
   1. Sort via the bubble sort.  Show your work after each pass through the "outer loop".  Include passes that due nothing.
   1. Sort via the merge sort.  Show your work before each merge.
   1. Sort via the heap sort.  Show your work after each adjustment of the "heap"
   1. Complete the following chart
   1. If you had to sort data that was so large it could not fit into memory, what sort would you consider modifying?  Why?  What is the work you are trying to minimize?
| Sort name | Best Case Description | Base Case Work Compares | Best Case Work Moves | Worst Case Description | Worst Case Work Compares | Worst Case Work Moves | Average Case Work Compares | Average Case Work Moves |
| Selection Sort | | | | | | | | |
| Insertion Sort | | | | | | | | |
| Bubble Sort | | | | | | | | |
| Merge Sort | | | | | | | | |
| Heap Sort | | | | | | | | |
Topic revision: r1 - 2021-10-05 - cathybareiss