优先队列（链表实现）

插入时需要按照优先级从高到低排序，一般操作系统的任务队列调度会用到

/* 优先队列(链表实现)
 * front 为队头指针(链表头节点)
 * rear 为队尾指针
 */
#include<stdio.h>
#include<stdlib.h>

typedef struct list_t{
	int _element;
	int _priority;
	struct list_t *_next;
}list_t;

/* 要改变一个变量的值，需要传入变量的地址作参数；
 * 要改变一个指针的值，需要传入该指针的地址作参数(即指针的指针)； 
 */
void insertPriorQueue(list_t **front, list_t **rear, int value, int priority)
{
	list_t *prev;
	list_t *curr;
	curr = (list_t*)malloc(sizeof(list_t));
	if(curr == NULL) {
		printf("error: malloc\n");
		exit(0);
	}
	curr->_element = value;
	curr->_priority = priority;
	curr->_next = NULL;
	if(*rear == NULL) { //empty queue: we need make front = rear = NULL
		*rear = curr;
		*front = *rear;
	} 
	else 
	{
	    /* if node to be inserted has highest priority hence should be the first node */
		if((*front)->_priority < priority) {
			curr->_next = *front;