LISTING LARGEST ELEMENTS

Let's think about solving the following problem. A web search engine matches queries against all the documents in a database and computes a score for each. It then needs to present the best documents to the user, in order.

Step 0
: Formalize problem.
Step 1
: Propose algorithms.
Step 2
: Prove correctness.
Step 3
: Prove running-time bounds.

next up previous
Up: Heaps (8) Previous: Heap Sort