# Category Archives: Heap

## How to check if a given array represents a Binary Heap?October 4, 2015

Given an array, how to check if the given array represents a Binary Max-Heap.

## Why is Binary Heap Preferred over BST for Priority Queue?September 7, 2015

A typical Priority Queue requires following operations to be efficient. Get Top Priority Element (Get minimum or maximum) Insert an element Remove top priority element… Read More »

## K’th largest element in a streamJune 22, 2015

Given an infinite stream of integers, find the k’th largest element at any point of time.

## Where is Heap Sort used practically?June 14, 2015

Although QuickSort works better in practice, the advantage of HeapSort worst case upper bound of O(nLogn). MergeSort also has upper bound as O(nLogn) and works… Read More »

## K’th Smallest/Largest Element in Unsorted Array | Set 1November 23, 2014

Given an array and a number k where k is smaller than size of array, we need to find the k’th smallest element in the… Read More »

## Binomial HeapNovember 3, 2014

The main application of Binary Heap is as implement priority queue. Binomial Heap is to extension of Binary Heap that provides faster union or merge… Read More »

## Binary HeapNovember 1, 2014

A Binary Heap is a Binary Tree with following properties. 1) It’s a complete tree (All levels are completely filled except possibly the last level… Read More »

## Print all elements in sorted order from row and column wise sorted matrixOctober 22, 2014

Given an n x n matrix, where every row and column is sorted in non-decreasing order. Print all elements of matrix in sorted order.

## Connect n ropes with minimum costAugust 17, 2014

There are given n ropes of different lengths, we need to connect these ropes into one rope. The cost to connect two ropes is equal… Read More »

## Merge k sorted arrays | Set 1July 29, 2013

Given k sorted arrays of size n each, merge them and print the sorted output.

## Heap SortMarch 16, 2013

Heap sort is a comparison based sorting technique based on Binary Heap data structure. It is similar to selection sort where we first find the… Read More »

## Design an efficient data structure for given operationsFebruary 8, 2013

Design a Data Structure for the following operations. The data structure should be efficient enough to accommodate the operations according to their frequency.

## Sort numbers stored on different machinesSeptember 26, 2012

Given N machines. Each machine contains some numbers in sorted form. But the amount of numbers, each machine has is not fixed. Output the numbers… Read More »

## Sort a nearly sorted (or K sorted) arraySeptember 8, 2012

Given an array of n elements, where each element is at most k away from its target position, devise an algorithm that sorts in O(n… Read More »

## Median in a stream of integers (running integers)October 27, 2011

Given that integers are read from a data stream. Find median of elements read so for in efficient way. For simplicity assume there are no… Read More »