sc/heap/README.md
Ozan Tezcan 020f6f740d
Fix build (#79)
Fix build
2022-02-05 00:11:52 +03:00

60 lines
1.0 KiB
Markdown

### Heap
### Overview
- Min-heap implementation, it can be used as Max-heap/priority queue as well.
### Usage
```c
#include "sc_heap.h"
#include <stdio.h>
int main(int argc, char *argv[])
{
struct data {
int priority;
char *data;
};
struct data n[] = {{1, "first"},
{4, "fourth"},
{5, "fifth"},
{3, "third"},
{2, "second"}};
struct sc_heap_data *elem;
struct sc_heap heap;
sc_heap_init(&heap, 0);
// Min-heap usage
for (int i = 0; i < 5; i++) {
sc_heap_add(&heap, n[i].priority, n[i].data);
}
while ((elem = sc_heap_pop(&heap)) != NULL) {
printf("key = %d, data = %s \n",
(int) elem->key, (char*) elem->data);
}
printf("---------------- \n");
// Max-heap usage, negate when adding into heap and negate back after
// pop :
for (int i = 0; i < 5; i++) {
sc_heap_add(&heap, -(n[i].priority), n[i].data);
}
while ((elem = sc_heap_pop(&heap)) != NULL) {
printf("key = %d, data = %s \n",
(int) elem->key, (char*) elem->data);
}
sc_heap_term(&heap);
return 0;
}
```