|
Quick Links
Calendar
Categories
Archives
Statistics
Total entries in this blog:
Total entries in this category: Published On: Mar 05, 2005 03:09 PM |
Lecture 21We covered two distinct topics
today.
We first saw two ways to build a heap. We analyzed both methods to find that one was O(N log N) and the other O(N). The second topic was accessing external memory. I used the data projector to present this topic. The presentation is attached. Next week we will continue discussing external memory concerns and B-trees. XternalBtrees2005.pdf Posted: Fri - March 4, 2005 at 03:08 PM |
||||||||||||||