Introduction

Sorting is one of the most important operations in computer science. It arranges the elements of a collection into a specific order, which makes searching and analyzing data much easier.

In this course of the Data Structures Series, we will explore Heap Sort, a sorting algorithm built on top of the binary heap.

A binary heap is a complete binary tree stored in an array. In a max-heap, every parent is greater than or equal to its children, so the largest value is always at the root. Heap Sort turns the array into a max-heap, then repeatedly removes the largest element to build the sorted result.

This course will include:

• Theory - understand how Heap Sort works.
• Implementation - build it in the programming language of your choice.
• Practice - solve coding challenges based on Heap Sort.

Let's get started!