L26A
00:00 Pseudo code of merge sort
08:45 Complexity of merge sort
L26B
00:00 Complexity of merge sort (cont. )
13:30 Shortest-path problem
16:40 Example
22:00 Principle of optimality
Title
第1節
第2節
Syllabus
L26A
00:00 Pseudo code of merge sort
08:45 Complexity of merge sort
03-5715131#35401 (請於上班時間來電,中午12-13為午休時間)
Copyright © 2010 NTHU. CTLD. 本網站所有內容嚴禁任何商業行為僅供學術使用