For the implementation of heap sort discussed in class, the worst case complexity for sorting an array of size N is code example

Example: heap sort name meaning

A sorting algorithm that works by first organizing the data to be sorted into a special type of binary tree called a heap. The heap itself has, by definition, the largest value at the top of the tree.