seqlist.h

有关队列的排序问题

#ifndef SEQLIST_H
#define SEQLIST_H

const int List_Init_Size=100;
const int  ListIncrement=10;

typedef int ElemType;
const int EndMark=0;

typedef struct
{
	ElemType* elem;//存储空间基址
	int length;//当前长度
	int listsize; //当前分配的存储容量(以sizeof(ElemType)为单位)
} Sqlist;

void InitList_sq(Sqlist& l);//构建一个链表
void DestroyList_sq(Sqlist& l);//销毁
void ClearList_sq(Sqlist& l);//清空
bool ListEmpty_sq(Sqlist l);
int ListLength_sq(Sqlist l);//链表长度
void GetElem_sq(Sqlist l, int i, ElemType& e);//取链表中的一元素
int LocateElem_sq(Sqlist l, ElemType e);//找一个为e的元素
void PriorElem_sq(Sqlist l, ElemType cur_e, ElemType& Pre_e);//前驱
void NextElem_sq(Sqlist l, ElemType cur_e, ElemType& Next_e);//后继
void ListInsert_sq(Sqlist& l, int i, ElemType e);//插入 
void ListDelete_sq(Sqlist&l, int i, ElemType& e);//删除
void ListTraverse (Sqlist L);//
bool compare(ElemType x,ElemType y);//比较

#endif