# Introduction In this lab, you will learn how to implement the Heap Sort algorithm using dynamic arrays in C++. Heap sort is a comparison-based sorting algorithm that works by dividing the input into a sorted and an unsorted region and iteratively shrinking the unsorted region by extracting the largest or smallest element and moving that to the sorted region.
Click the virtual machine below to start practicing