Heap Sort

15 posts

Top Interview Questions and Answers on Heap Sort

Last Updated: 23 July 2025

Heap sort is a highly efficient sorting algorithm that utilizes a binary heap data structure to organize and sort elements. Its time complexity of O(n log n) makes it a po...read more

Sorting

DSA

interview-preparation

Heap Sort

Interview-Questions

Searching and Sorting Algorithm Notes for GATE Exam [2024]

Last Updated: 23 July 2025

As you gear up for the GATE Exam 2024, it's time to dive into the world of searching and sorting algorithms. Think of these algorithms as the super-smart tools that help c...read more

Algorithms-BubbleSort

Maximize total count from the given Array

Last Updated: 23 July 2025

Given an array nums of length N which contains two types of numbers, one which has the value zero, the second which is a positive integer, the task is to collect numbers f...read more

Max Sum of At Most Two Non-Overlapping Intervals

Last Updated: 12 November 2025

Given an array interval[] , where each element represents the following three valuesstartTime – the time when the interval beginsendTime – the time when the interval endsv...read more

Minimize difference between the largest and smallest array elements by K replacements

Last Updated: 23 July 2025

Given an array A[] consisting of N integers, the task is to find the minimum difference between the largest and the smallest element in the given array after replacing K e...read more

K-th Smallest Element in an Unsorted Array using Priority Queue

Last Updated: 23 July 2025

Given an array arr[] consisting of N integers and an integer K, the task is to find the Kth smallest element in the array using Priority Queue.Examples:Input: arr[] = {5, ...read more

Print nodes of a Binary Search Tree in Top Level Order and Reversed Bottom Level Order alternately

Last Updated: 15 July 2025

Given a Binary Search Tree, the task is to print the nodes of the BST in the following order:If the BST contains levels numbered from 1 to N then, the printing order is le...read more

Sorting algorithm visualization : Heap Sort

Last Updated: 15 July 2025

An algorithm like Heap sort can be understood easily by visualizing. In this article, a program that visualizes the Heap Sort Algorithm has been implemented.The Graphical ...read more

Merge two sorted arrays in constant space using Min Heap

Last Updated: 12 July 2025

Given two sorted arrays, we need to merge them with O(1) extra space into a sorted array, when N is the size of the first array, and M is the size of the second array. Ex...read more

Lexicographical ordering using Heap Sort

Last Updated: 12 July 2025

Given an array arr[] of strings. The task is to sort the array in lexicographical order using Heap Sort.Examples:Input: arr[] = { "banana", "apple", "mango", "pineapple", ...read more

DSA

Heap Sort

Heap Sort for decreasing order using min heap

Last Updated: 22 February 2025

Given an array of elements, sort the array in decreasing order using min heap.Examples:Input : arr[] = {5, 3, 10, 1}Output : arr[] = {10, 5, 3, 1}Input : arr[] = {1, 50, 1...read more

Last Updated: 05 February 2026

Heap Sort is a comparison-based sorting algorithm based on the Binary Heap data structure.It is an optimized version of selection sort.The algorithm repeatedly finds the m...read more

C++ Program for Heap Sort

Last Updated: 23 July 2025

Heap sort is a comparison-based sorting technique based on the Binary Heap data structure. It is similar to the selection sort where we first find the maximum element and ...read more

Java Program for Heap Sort

Last Updated: 23 July 2025

Heap sort is a comparison-based sorting technique based on the Binary Heap data structure. It is similar to the selection sort where first find the maximum element and pla...read more

Last Updated: 16 January 2026

Heap Sort is a comparison-based sorting algorithm that uses a Binary Heap data structure. It works similarly to Selection Sort, where we repeatedly extract the maximum ele...read more

python sorting-exercises

Python-DSA