Lecture 18.Roman Suvorov is the winner of the Stack
programming challenge. Roman kindly agreed to give the class a presentation of
his different implementations of a stack. Roman used visual basic to design a
very pretty graphics user interface as a front end to his C++ stack
implementations.
StackChallenge.pdf We continued with our examination of heaps today. We saw algorithms for the heap operations. We also performed a complexity analysis of these operations. We also saw how an array could be used as an implicit complete binary tree in the implementation of heaps. An important applications of heaps is the heapsort algorithm. Today we saw how heapsort is an efficient variation of the familiar selection sort algorithm. Posted: Fri - February 16, 2007 at 10:02 AM |
Quick Links
Calendar
Categories
Archives
XML/RSS Feed
Statistics
Total entries in this blog:
Total entries in this category: Published On: Mar 09, 2007 10:21 AM |
||||||||||||||