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.
1
(2 marks)
Founded in late 2003 and heartquartered in France, we are non-profit and independant.
We believe in the open web, think internet services should be sustainable, build for the long term.
While we are re-launching the service, we only accept new members through invitation.
YukuanMark
last mark : 29/08/2006 13:28