1.针对快速排序、归并排序进行时间复杂度理论分析

2.针对快速排序、归并排序进行时间复杂度的实验分析

⑴用你自己熟悉的语言实现快速排序和归并排序算法

⑵随机生成不同规模的随机数据，记录算法在不同规模下的执行时间，进一步分析两个算法的执行时间与问题规模的关系。

-1. According to the quick sort, merge sort time complexity theory analysis

2. For quick sort, merge sort time complexity experimental analysis

(1) in your own familiar language to realize quick sort and merge sort algorithm

(2) random generation of different size random data, record algorithm in different scale of the execution time, further analysis of two algorithms of the execution time and the relationship between the scale problem.