Monday,
---------- Oct. 13, 2008
A holiday :)
Wednesday,
---------- Oct. 15, 2008
We worked on the time complexity of merger sort. I knew that its complexity is (nlgn) from CSC165 but I could never figure out how to prove such a complicated thing. After we did the proof I find it to be lengthy more than complicated.
Friday,
---------- Oct. 17, 2008
The master theorem... I need to go to the course notes and read through it again because I kind of lost track by the end of the lecture (not because it is that hard but 4-hours of sleep is never enough for me).
skip to main |
skip to sidebar
::Welcome to my online journal where I record,
on a weekly bases, the progress, challenges,
and other interesting events that happen
with me in CSC236 this fall at UofT::
::Welcome to my online journal where I record,
on a weekly bases, the progress, challenges,
and other interesting events that happen
with me in CSC236 this fall at UofT::
1 comment:
Yes, I think lengthy rather than deep is a good description of the proof of complexity of mergeSort. It proceeds through three steps, and the same sort of approach applies to the master theorem.
Post a Comment