Homework 4: Selection Algorithms Experimental Study - Prof. Kasturi Varadarajan, Assignments of Algorithms and Programming

Download Homework 4: Selection Algorithms Experimental Study - Prof. Kasturi Varadarajan and more Assignments Algorithms and Programming in PDF only on Docsity! 22C : 231 Design and Analysis of Algorithms Fall 2004 Homework 4: Programming Assignment Due on Friday, December 3 The programming assignment asks you to perform an experimental study and compari- son of three algorithms for Selection: (1) the median of medians algorithm we discussed in class; (2) the simple randomized algorithm from Homework 2; (3) the algorithm that sorts the input set and picks the k’th smallest. Recall that in Selection, the input is a set of say n integers and an integer k between 1 and n, and the output is the k’th smallest integer in the set. Besides implementing the three algorithms, you will also have to implement a program that generates inputs. It is up to you to decide what kind of generator/generators you wish to implement. Your submission will of course include the code that you wrote, but the more signif- icant component will be a report on the experimental study. This report should include a description of the generators, a description of how each of the three programs performs (in terms of actual running time) on the generated input, and a comparison between the three programs. For the study to be meaningful, the size of the data generated needs to be reasonably large. You could also report on the influence of the parameter k on the study, if this is interesting. You are also encouraged to report on interesting aspects of the study that are not discussed here. I will later post instructions on how to submit the code. 1