Computers and Technology, 05.07.2021 19:40 radazharula1
The selection algorithm (to find thekth smallest value in a list), described in the class(and in the book), uses columns of size 5. Assume that you implement the same selectionalgorithm using columns of size 17, rather than 5.
Required:
a. Exactly how far from either end of the array is the median of medians guaranteed to be. Just give the high order term. (Recall that with columns of size 5 we got in.)
b. It turns out that there is an algorithm that finds the median of 9 elements with 14 com- parisons. Using this algorithm, briefly list each step of Selection with columns of size 9 and how many comparisons the step takes. Note that partition can now be done with only (4/9)n comparisons; use this value in your analysis.
c. Write a recurrence for the number of comparisons the algorithm uses.
d. Solve the recurrence using constructive induction. Just get the high order term exactly.
e. With more careful analysis, in class we could have obtained 16n comparisons using columns of size 5. How does this new value, using columns of size 9, compare?
Answers: 1
Computers and Technology, 24.06.2019 08:30
Why might you choose to create a functional resume
Answers: 1
Computers and Technology, 24.06.2019 23:00
The valves of the heart and veins are similar in that they both
Answers: 1
Computers and Technology, 25.06.2019 04:30
What is the purpose of network permissions? a)to control access to network resources b)to convert to wireless networking c)to enable the installation of nics d)to reduce operating costs
Answers: 1
The selection algorithm (to find thekth smallest value in a list), described in the class(and in the...
English, 14.07.2019 09:00
History, 14.07.2019 09:00
Social Studies, 14.07.2019 09:00
Mathematics, 14.07.2019 09:00
Biology, 14.07.2019 09:00
Advanced Placement (AP), 14.07.2019 09:00
Chemistry, 14.07.2019 09:00
Health, 14.07.2019 09:00