A heap is a balanced tree which has some special properties. There are two variations of heap: MinHeap and MaxHeap. In a MinHeap, the root node is lesser than all the child nodes. MaxHeap has the maximum value in the
The Introduction to FAST Search API provides an introduction on how to use the FAST API. FAST stores documents in a collection. We usually perform searches on a collection. But there are times when we want all documents in a collection.
QuickSelect is a selection algorithm that finds the kth smallest number from a list. QuickSelect is O(n) algorithm. I built a simple prototype to verify that QuickSelect works in linear time. QuickSelect uses a random pivot to partition the array. The