## Sort a K-Sorted Array

Given a k-sorted array that is almost sorted such that each of the N elements may be misplaced by no more than k positions from the correct sorted order. Find a space-and-time efficient algorithm to sort the array.

## Find K’th largest element in an array

Given an array and positive integer k, find K’th largest element in the array.

## Convert Max Heap to Min Heap in linear time

Given an array representing a Max Heap, in-place convert the array into the min heap in linear time.

## Check if an array represents min heap or not

Given an array of integers, check if it represents min heap or not.

## Heap Sort Algorithm – Overview & C, C++ and Java Implementation

Given an array of integers, sort it using heap sort algorithm in C, C++ and Java.

## Min Heap and Max Heap Implementation in C++

Implement heap data structure.

## Introduction to Priority Queues using Binary Heaps

In this article, we will introduce a very important data structure Priority Queues and discuss how we can implement them using (Binary) Heaps.

## Find first k maximum occurring words in given set of strings

Given a huge set of strings with duplicate strings present, find first k-maximum occurring words in it.

## Single-Source Shortest Paths – Dijkstra’s Algorithm

Given a source vertex s from set of vertices V in a weighted graph where all its edge weights w(u, v) are non-negative, find the shortest-path weights d(s, v) from given source s for all vertices v present in the graph.