Problem 10
\begin{aligned} &\text { Trace a walkthrough of selection sort with these lists: }\\\ &\begin{array}{rrrrrrrrrrrr} \text { a. } & 4 & 7 & 11 & 4 & 9 & 5 & 11 & 7 & 3 & 5 & \\ \text { b. } & -7 & 6 & 8 & 7 & 5 & 9 & 0 & 11 & 10 & 5 & 8 \end{array} \end{aligned}
Problem 11
Trace a walkthrough of merge sort with these lists: \(\begin{array}{llllllllllll}\text { a. } & 5 & 11 & 7 & 3 & 5 & 4 & 7 & 11 & 4 & 9 & \\ \text { b. } & 9 & 0 & 11 & 10 & 5 & 8 & -7 & 6 & 8 & 7 & 5\end{array}\)
Problem 13
Write a program that sorts a list of country objects in decreasing order so that the most populous country is at the beginning of the list.
Problem 13
Your task is to remove all duplicates from a list. For example, if the list has the values 471149511735 then the list should be changed to 4711953 Here is a simple algorithm. Look at values [ \(\\{\) ). Count how many times it occurs in values. If the count is larger than 1 , remove it. What is the growth rate of the time required for this algorithm?
Problem 14
Modify the merge sort algorithm to remove duplicates in the merging step to obtain an algorithm that removes duplicates from a list. Note that the resulting list does not have the same ordering as the original one. What is the cfficiency of this algorithm?
Problem 16
Implement the merge sort algorithm without recursion, where the length of the list is a power of 2. First merge adjacent regions of size 1, then adjacent regions of size 2, then adjacent regions of size 4 , and so on.
Problem 16
Develop an \(O(n \log (n))\) algorithm for removing duplicates from a list if the resulting list must have the same ordering as the original list. When a value occurs multiple times, all but its first occurrence should be removed.
Problem 17
Implement the merge sort algorithm without recursion, where the length of the list is an arbitrary number. Keep merging adjacent regions whose size is a power of 2, and pay special attention to the last area whose size is less.
Problem 17
Why does insertion sort perform significantly better than selection sort if a list is already sorted?
Problem 19
Consider the following algorithm known as bubble sort:What is the big-Oh efficiency of this algorithm?
