20 August 2006
17 August 2006
Heapsort
by YukuanMarkWith its time complexity of O(n log(n)) heapsort is optimal. It utilizes a special data structure called heap. This data structure is explained in the following.
29 July 2006
[ GTL ] The Graph Template Library
by YukuanMarkGTL, the Graph Template Library GTL can be seen as an extension of the Standard Template Library STL to graphs and fundamental graph algorithms.
1
(3 marks)