Sign inSign in
ConceptSystems & CS

Top-N heap sort

An optimized sorting strategy using a priority queue to retrieve only the top N elements requested by a query with an ORDER BY and LIMIT clause.
as Jignesh Patel defines itCarnegie Mellon University
Watch it explained

Know first

Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.

Heap1Heap data structure1Priority queue1Sorting1SQL ORDER BY and LIMIT clauses1

Lecturers

1

    Connections

    4

    The lectures that define it or assume it, and the concepts next to it.

    Concepts3

    Lecture1

    1 lecturer. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.