Unformatted text preview: peripheral actions like I/O. For example, for the list [-1 2 3 4 -2 10 3 7 9 -1 -2 6 4 5], N=14 and F=4. The following may be a scheme for experimental set up: (N=50, (F=5, 10, 15, 20, 25)), (N=100, (F=10, 20, 30, 40, 50), . . . For each pair (N,F), there should be at least 30 samples over which the step-counts should be averaged as the experimental output. Grading will be based on the quality of the experimental set up and data analysis. How you organize your experiment and generate data is up to you. Feel free to discuss with me. Your submission will be a hard copy: (1) a report (<10 pages) discussing your experimental results, and an appendix containing (2) the source code(s). I may ask for demo for selected groups....
View Full Document
- Spring '12
- Algorithms, Analysis of algorithms, Computational complexity theory, Test method, naïve algorithm maxSubSum1