[Home]

[Previous Chapter]

[Next Chapter]


5. Selection Algorithms

  1. Priority queues

    1. Sorted/unsorted lists
    2. P-trees
    3. Heaps
    4. Van Emde-Boas priority queues
    5. Pagodas
    6. Binary trees used as priority queues
      1. Leftist trees
      2. Binary priority queues
      3. Binary search trees as priority queues
    7. Binomial queues
    8. Summary

  2. Selection of kth element

    1. Selection by sorting
    2. Selection by tail recursion
    3. Selection of the mode



© Addison-Wesley Publishing Co. Inc.