Max heap in c

The following C project contains the C source code and C examples used for max heap. Max heap is a binary tree like data structure, that always contains the biggest element at its top. Max heap is greatly used in searching and sorting algos and in priority queues, as it reduces the sorting time to o(nlogn).

The source code and files included in this project are listed in the project files section, please make sure whether the listed source code meet your needs there.

Project Files: 

File NameSize