Berkeley CS 61B Homework8

llllll  第八个

[ 6 3 6 7 2 5 6 6 3 9 ]
[ 2 3 3 5 6 6 6 6 7 9 ]
[ 7 6 2 1 8 0 8 1 2 9 ]
[ 0 1 1 2 2 6 7 8 8 9 ]
Mergesort time, 10 Integers:  0 msec.
Quicksort time, 10 Integers:  0 msec.
Mergesort time, 100 Integers:  2 msec.
Quicksort time, 100 Integers:  1 msec.
Mergesort time, 1000 Integers:  7 msec.
Quicksort time, 1000 Integers:  7 msec.
Mergesort time, 10000 Integers:  24 msec.
Quicksort time, 10000 Integers:  12 msec.
Mergesort time, 100000 Integers:  171 msec.
Quicksort time, 100000 Integers:  157 msec.
Mergesort time, 1000000 Integers:  3247 msec.
Quicksort time, 1000000 Integers:  1417 msec.

Process finished with exit code 0

所以 运行时间 跟CPU也有关？

交作业，还有一周开学，加油~~ 这个作业做的不顺，前面学的try&catch都有点忘了，cast也搞得有点晕。

哇 是真滴慢 电脑型号 MacBook Air（13 英寸，2015 年初）

交作业~

打卡，为什么我的运行时间要这么久？

完成了. Quicksort 花了些時間想recursive的處理

1. D:\Git\DSA\CS61B\hw8>java -ea ListSorts
   
2. [ 5 1 4 8 1 8 1 9 7 5 ]
   
3. [ 1 1 1 4 5 5 7 8 8 9 ]
   
4. [ 4 9 4 2 6 7 5 6 8 7 ]
   
5. [ 2 4 4 5 6 6 7 7 8 9 ]
   
6. Mergesort time, 100 Integers:  0 msec.
   
7. Quicksort time, 100 Integers:  0 msec.
   
8. Mergesort time, 1000 Integers:  0 msec.
   
9. Quicksort time, 1000 Integers:  0 msec.
   
10. Mergesort time, 10000 Integers:  13 msec.
    
11. Quicksort time, 10000 Integers:  10 msec.
    
12. Mergesort time, 100000 Integers:  97 msec.
    
13. Quicksort time, 100000 Integers:  84 msec.
    
14. Mergesort time, 1000000 Integers:  1994 msec.
    
15. Quicksort time, 1000000 Integers:  1216 msec.

复制代码

我的MergeSort和QuickSort都是Stable的
Is mergesort stable?  
  Ans: Stable
  Why or why not?
  Ans: My merge sort would enqueue the first equal item, so that would not impact the order of equal items(ListSorts #61).

  Is quicksort stable?  
  Ans: Stable
  Why or why not?
  Ans: My quick sort would not change the order of equal items(ListSorts #167).

homework8打卡~
虽然挺简单的，但是还是写了一整个晚上。。每次写完总要debug才能通过。。