《数据结构与算法》书中所有算法汇总

Status InsertList (SqList &L,int I,ElemType e)
{
If (i<1‖i>l.length+1) return ERROR;
If (L.length>=L.ListSize)
{
Newbase=(ElemType *)realloc(L.elem,(L.listsize+10*sizeof(ElemType));
If (!newbase) return ERROR:
L.elem=newbase;
L.Listsize+=10;
}
For (j=L.length-1;j>=i-1;j--)
L.elem[j+1]=L.elem[j];
l.elem[j-1]=e;
++l.length;
Return OK;
}
2.顺序表删除
Status InsertList (SqList &L,int I,ElemType e)
{
If (i<1‖i>l.length+1) return ERROR;
e=L.elem[i-1];
for (j=I;j<=l.length-1;j++)
l.elem[j-1]=l.elem[j];
l.length --;
return OK;
}
3.链式表插入
Status InsertList (LinkList &H,int I,ElemTpye e)
{
P=H;
For (j=1;j<=i-2&&P;j++) P=P→next;
If (!p) return ERROR;
New=(LinkList)malloc(sizeof(LNode));
If (!new) return ERROR;
new→data =e;
new→next =p→next;
p→next =new;
return OK;
}
Status DeleteList (LinkList &H,int I,ElemTpye &e) {
P=H;
For (j=1;j<=i-2&&P;j++)
P=p→next;
If(!p) return ERROR:
Q=p→next;
E=q→next;
Free(q);
Return OK;
}
5.入队列
Status EnQueue (SqQuene &q,QElemTpye e) {
If (Q.tear+1)%MAXQSIZE==Q.front)
Return ERROR;
Q.base[Q.tear]=e;
Q.tear=(Q.tear+1)%MAXQSIZE;
Return OK;
}
6.出队列
Status EnQueue (SqQueue &Q,Qelemtype &e) {
If (Q.rear==q.front)
Return ERROR;
E=q.base[q.font];
Q.front =(Q.front+1)%MAXQSIZE;
Return OK;
}
7.二叉树中序非递归遍历
Void InTraerse (BiTree T)
{
InitStack (s); P=T;
While (P‖!StackEmpty (s))
{
If (p)
{
Push (s,p); p=p→lchild;
}
Else
{
Pop (s,p);
Visit (P→data);
P=P→rchild;
}
8.插入排序
Void InsertSort (Sqlist &L)
{
For (i=2;i<=l.length;i++)
{
If (l.r[i].key<l.r[i-1].key)
{
l.r[0]=l.r[i];
for (j=i-1;j>=0&&l.r[j].key>l.r[0].key;i--)
l.r[j+1]=l.r[j];
l.r[j+1]=l.r[0];
}
}
}
9.折半插入排序
Void BinInsertSort (sqlist &L)
{
For (i=2;i<=l.length;i++)
{
If (L.r[i].key<l.r[i-1].key)
{
l.r[0]=l.r[i];
low=1; high=i-1;
while (low<=high)
{
Mid=(low+high)/2;
If (l.r[mid].key>l.r[0.key])
High=mid-1;
Else
Low +mid+1;
}
For (j=i-1;j>=low;j--)
l.r[j+1]l.r[j]; l.r[low]=l.r[0];
}
10.气泡排序
Void Sort (sqlist &L)
{
For (j=1;j<=l.length-1;i++) {
For (j=1;j<=l.length-I;j++)
If (l.r[j].key>l.r[j+1].key)
{
l.r[0]=l.r[j];
l.r[j]=l.r[j+1];
l.r[j+1]=l.r[0];
}
}
}
11.选择排序
Void SelectSort (Sqlist &l) {
For (i=1;i<=l.length-1;i++) {
Min=I;
If (min!=i)
{
l.r[0]=l.r[min];
l.r[min]=l.r[i];
l.r[i]=l.r[0];
}
}
}。