实现快排最优版本算法上机报告.doc

算法导论第二次上机报告 班级：1403018 姓名：张可心 学号：14030188030 （一）题目一 一、问题 This project requires you to implement an optimized version of quicksort, and compare the performances of the following combinations: Cutoff values from 0 to 50; Take pivot to be the 1st element, random, median of random three, and median of random five. The tests must be done on the following three kinds of inputs: sorted input; reverse-ordered input; random input. The size of input can be taken from 1000 to 10000. The run times must be plotted with respect to the sizes to illustrate the difference. (figure out using excel, matlab in t