關於本次作業的作業要求

[單單]

Dear all,

請問這次的作業要求是寫出MST以及heap sort嗎?
還是只要寫出MST的兩種演算法呢?
謝謝~

Felicia

[Shyong Jian Shyu]

Dear All:

 

Since I have ever mentioned that heapsort should be implemented as an assignment and should be compared with quicksort and mergesort, please keep in mind to give this and minimal spanning tree problem as two assignments by next Sat. (5/2). I summarize them as follows:

(1) hearsort (comparing its performence with those of quicksort and mergesort);

(2) finding minimal spanning tree using Kruskal's and Prim's algorithms respectively (with both dense and sparse distance-matrices).

 

Thus, there are two assignments. The due-date is 5/2 11:50pm.

BTW, the Midterm will be held no 5/5.

 

Good luck.

 

S. J.

 

2009/4/21 單單 <felici...@gmail.com>