Advanced Sorting

  • Noel Kalicharan


In this chapter, we will explain the following:
  • What a heap is and how to perform heapsort using siftDown

  • How to build a heap using siftUp

  • How to analyze the performance of heapsort

  • How a heap can be used to implement a priority queue

  • How to sort a list of items using quicksort

  • How to find the kth smallest item in a list

  • How to sort a list of items using Shell (diminishing increment) sort


Priority Queue Division Point Complete Binary Tree Large Child Public Class 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Copyright information

© Noel Kalicharan 2014

Authors and Affiliations

  • Noel Kalicharan
    • 1
  1. 1.New DelhiIndia

Personalised recommendations