Heap & Priority Queue
Definition & Description:
In /data structures, a priority queue is an which is like a regular or data structure, but where additionally each element has a "priority" associated with it. In a priority queue, an element with high priority is served before an element with low priority. If two elements have the same priority, they are served according to their order in the queue
Similarly, in a multiuser environment, the operating system scheduler must decide which of several processes to run. Generally a process is only allowed to run for a fixed period of time. One algorithm uses a queue. Jobs are initially placed at the end of the queue. The scheduler will repeatedly take the first job on the queue, run it until either it finishes or its time limit is up, and place it at the end of the queue if it does not finish. This strategy is generally not appropriate, because very short jobs will seem to take a long time because of the wait involved to run. Generally, it is important that short jobs finish as fast as possible, so these jobs should have preference over jobs that have already been running. Furthermore, some jobs that are not short are still very important and should also have preference.
This particular application seems to require a special kind of queue, known as a priority queue .
---------------------------------------------------------------------------------------------------------------------------------------------
update: 2014.09.20 (补充对heap进行解释说明)
以下图示是一个最大堆.
Heap property All nodes are either greater than or equal to or less than or equal to each of its children, according to a comparison defined for the heap.
Implementation:
Let's have a peak about what files we need to finish this work.
priority_queue.h
/*********************************************************code writer : EOFcode date : 2014.09.19code file : priority_queue.he-mail : jasonleaster@gmail.comcode purpose : Just a header file for my implementation. What you should know is that you may callinit_heap() when you want to create a priority queue.And then you could use build_heap() to create that queuewith your source--@array.*********************************************************/#ifndef _PRIORITY_QUEUE_H#define _PRIORITY_QUEUE_H #include#include #define EMPTY_HEAP -1 #define NOEMPTY_HEAP 0 #define FULL_HEAP 1 #define NOFULL_HEAP 0 struct heap { int capacity; int size; /* ** ATTENTION! Just a little trick. */ int element[0]; }; struct heap* init_heap(int max_size); void destroy_heap(struct heap* p_heap); void insert_heap(struct heap* p_heap,int element); int delete_heap(struct heap* p_heap); void build_heap(struct heap* p_heap,int* array,int size); void precolate_down(struct heap* p_heap,int parent); int is_empty(struct heap* p_heap); int is_full(struct heap* p_heap); void print_heap(struct heap* p_heap);#endif
build_heap.c
/*********************************************************code writer : EOFcode date : 2014.09.19code file : build_heap.ce-mail : jasonleaster@gmail.comcode purpose : @p_heap : A pointer which point to our heap. @array : A pointer which point to our input-data which we want to fill heap with it. @size : The size of our array.*********************************************************/#include "priority_queue.h"void build_heap(struct heap* p_heap,int* array,int size){ if(!p_heap || !array) { printf("In function: %s() p_heap: %p array: %p\n",__FUNCTION__,p_heap,array); return ; } p_heap->size = size; int index = 0; int tmp = 0; int foo = 0; int min = 0; int parent = 0; int right_child = 0; int left_child = 0; for(index = 0; index < size ;index++) { p_heap->element[index+1] = array[index]; } for(parent = size/2; parent > 0; parent--) { precolate_down(p_heap,parent); }} delete_heap.c
/*********************************************************code writer : EOFcode date : 2014.09.19code file : delete_heap.ce-mail : jasonleaster@gmail.com*********************************************************/#include "priority_queue.h"int delete_heap(struct heap* p_heap){ if(!p_heap) { printf("malloc failed in function %s()!\n",__FUNCTION__); return -1; } /* ** You have to know that heap data get start from ** element[1] which is just for simplicty to implement ** heap in array. */ int min_element = p_heap->element[1]; int last_element = p_heap->element[p_heap->size--]; int me = 0; int child = 0; for(me = 1;me*2 < p_heap->size; me = child) { child = me*2; /* ** Make sure that child index into the smaller one ** between the right child and the left child. */ if(child != p_heap->size && p_heap->element[child+1] < p_heap->element[child]) { child++; } if(last_element > p_heap->element[child]) { p_heap->element[me] = p_heap->element[child]; } else { break; } } p_heap->element[me] = last_element; return min_element;} destroy_heap.c
/*********************************************************code writer : EOFcode date : 2014.09.19code file : destroy_heap.ce-mail : jasonleaster@gmail.comcode description: **NEVER** forget to call this function to free outmemory which p_heap point to.*********************************************************/#include "priority_queue.h"void destroy_heap(struct heap* p_heap){ if(!p_heap) { printf("malloc failed in function %s()!\n",__FUNCTION__); return ; } free(p_heap);} init_heap.c
/*********************************************************code writer : EOFcode date : 2014.09.19code file : init_heap.ce-mail : jasonleaster@gmail.comcode purpose : @max_size : what's the size of the heap that you want to create it ?
This function would return a pointer which point to the heap that you created. *********************************************************/ #include "priority_queue.h" struct heap* init_heap(int max_size) { if(max_size < 0) { return NULL; } struct heap* p_heap = NULL; p_heap = (struct heap*)malloc(sizeof(int)*(max_size+1) + sizeof(struct heap)); if(!p_heap) { printf("malloc failed in function %s()!\n",__FUNCTION__); return NULL; } p_heap->capacity = max_size; p_heap->size = 0; return p_heap; }
insert_heap.c
/*********************************************************code writer : EOFcode date : 2014.09.19code file : insert_heap.ce-mail : jasonleaster@gmail.comcode purpose : Just call this function and insert @element intoheap that @p_heap point to.*********************************************************/#include "priority_queue.h"void insert_heap(struct heap* p_heap,int element){ if(!p_heap) { printf("p_heap is NULL in function %s\n",__FUNCTION__); return ; } int child = 0; /* ** Percolate up */ for(child = ++p_heap->size; p_heap->element[child/2] > element; child/=2) { p_heap->element[child] = p_heap->element[child/2]; } p_heap->element[child] = element;} is_empty.c
/*********************************************************code writer : EOFcode date : 2014.09.19code file : is_empty.ce-mail : jasonleaster@gmail.com*********************************************************/#include "priority_queue.h"int is_empty(struct heap* p_heap){ if(!p_heap) { printf("p_heap is NULL in function %s()\n",__FUNCTION__); return -1; } if(!p_heap->size) { return EMPTY_HEAP; } return NOEMPTY_HEAP;} is_full.c
/*********************************************************code writer : EOFcode date : 2014.09.19code file : is_full.ce-mail : jasonleaster@gmail.com*********************************************************/#include "priority_queue.h"int is_full(struct heap* p_heap){ if(!p_heap) { printf("p_heap is NULL in function %s()\n",__FUNCTION__); return -1; } if(p_heap->size >= p_heap->capacity) { return FULL_HEAP; } return NOFULL_HEAP;} precolate_down.c
/*********************************************************code writer : EOFcode date : 2014.09.19code file : precolate_down.ce-mail : jasonleaster@gmail.comcode purpose : This is a implementation of precolate_down() whichuse recursion.*********************************************************/#include "priority_queue.h"void precolate_down(struct heap* p_heap,int parent){ /* ** If we got the last parent, precolate_down() end. */ if(2*parent > p_heap->size) { return; } int tmp = 0; int foo = 0; int min = 0; int right_child = 0; int left_child = 0; tmp = p_heap->element[parent]; foo = p_heap->element[parent]; left_child = p_heap->element[2*parent]; /* ** If we got the last parent and the size of ** heap is even. This means that the child of the ** last parent is just only one.Here is the method ** to process this situation. */ if(p_heap->size %2 == 0 && 2*parent == p_heap->size) { if(foo > min) { tmp = p_heap->element[parent]; p_heap->element[parent] = p_heap->element[2*parent]; p_heap->element[2*parent] = tmp; } return ; } /* ** If parent have two child. */ right_child = p_heap->element[2*parent+1]; min = left_child < right_child ? left_child : right_child; if(foo > min) { if(right_child > left_child) { tmp = p_heap->element[parent]; p_heap->element[parent] = p_heap->element[2*parent]; p_heap->element[2*parent] = tmp; precolate_down(p_heap,2*parent); } else { tmp = p_heap->element[parent]; p_heap->element[parent] = p_heap->element[2*parent+1]; p_heap->element[2*parent+1] = tmp; precolate_down(p_heap,2*parent+1); } } }
print_heap.c
/*********************************************************code writer : EOFcode date : 2014.09.19code file : print_heap.ce-mail : jasonleaster@gmail.comcode description: Just print out the current heap that @p_heap pointto.*********************************************************/#include "priority_queue.h"void print_heap(struct heap* p_heap){ if(!p_heap) { printf("You passed NULL in function %s()\n",__FUNCTION__); return ; } printf("The capacity of heap : %d\n",p_heap->capacity); printf("The size of heap:%d\n",p_heap->size); int index = 0; int tmp = 1; for(index = 0,tmp = 2;index < p_heap->size;index++) { printf("%d ",p_heap->element[index+1]); if(index == 0) { printf("\n"); } else if(index == tmp) { tmp += 1< 測试用程序： priority_queue_test.c
/*********************************************************code writer : EOFcode date : 2014.09.19code file : priority_queue_test.ce-mail : jasonleaster@gmail.comcode description: This code would help us to test our implementationof heap.*********************************************************/#include "priority_queue.h"int main(){ int array[] = {10,12,1,14,6,5,8,15,3,9,7,4,11,13,2}; int size = sizeof(array)/sizeof(array[0]); struct heap* p_heap = NULL; p_heap = init_heap(size); if(!p_heap) { printf("Inintialize failed!\n"); return 0; } build_heap(p_heap,array,size); print_heap(p_heap); delete_heap(p_heap); print_heap(p_heap); insert_heap(p_heap,43); print_heap(p_heap); destroy_heap(p_heap); return 0;} 測试结果：
update :2015.01.12
使用Python实现Heap
"""**************************************************Code writer : EOFCode date : 2015.01.10Code file : heap_demo.pye-mail : jasonleaster@gmail.comCode purpose: There is a implementation of ADT-Heap whichis in Python. If you find something error with my code, please touch me by e-mail. Thank you.*****************************************************"""import sys"""These function are used for searching the index of parent, left child and right child"""def parent(i): return i/2def left(i): return i*2def right(i): return (i*2 + 1)""" We store the size of heap as the firstelement of Heap."""def heap_size(A) : return A[0]def init_input(A) : size = len(A) A = [size] + A return Adef max_heapify(A, i) : l = left(i) r = right(i) if l < heap_size(A) and A[l] > A[i] : largest = l else : largest = i if r < heap_size(A) and A[r] > A[largest] : largest = r if largest != i : tmp = A[i] A[i] = A[largest] A[largest] = tmp max_heapify(A,largest) return Adef build_max_heap(A) : hs = heap_size(A) for i in range(hs/2,0,-1) : A = max_heapify(A,i) return Adef show_heap(A) : depth = 0 depth_up_bound = 0 tmp = heap_size(A) while tmp > 0: depth_up_bound += 1 tmp >>= 1 for i in range(1,heap_size(A)+1) : if i == (1<
