Priority queues

Min heap in c

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

List queue in c

The following C project contains the C source code and C examples used for list & queue. List & Stack in C++ using either pointers (linked list) or an array (of fixed size) made for and exercise in Software Engineering
Subscribe to RSS - Priority queues