用冒泡和快速排序算法对一个足够长的数据序列进行排序，比较两种算法的时间复杂度，记录所用时间并分析。实验数据随机产生（数据的取值范围在1～100000之间，数据个数由用户从终端输入）。

-With a bubble sort algorithm and fast enough for a long sequence of data to sort, compare two time complexity of the algorithm, the time spent recording and analysis. Randomly generated test data (the data in the range between 1 to 100,000, the number of input data from the user terminal).