CS 330 Algorithms

Homework 4

 

Remember: "Argue"="Prove", "[Show/Explain] How"="Give pseudo-code" (remember: top-down approach allows grader to stop at any level of detail; pseudo-code for trivial subroutines can be left out), etc.

Max, Min, Median, Select:

Heaps

Leftist Heaps:

In all the above, show intermediate steps, marking the rank of each node.

"Linear" sorts:

Dictionary/Dynamic-set (review: lists, stacks, queues, trees)
(most of the problems below are relatively simple and were covered to large extent in your cs111-112)

 

Extra credit problems: