两道扩展的排序题

//排序题
//设计一个双向冒泡排序法，即在排序过程中交替改变扫描方向
void BiBubble(Sqlist &L)
{
	int i,j;
	int temp;
	int tag = 0;
	int low=1, high=L->length;
	for (i = 1; i < L->length&&tag==0; i++)
	{
		tag = 1;
		if (i % 2 == 0)
		{
			for (j = high; j >low; j--)
			{
				if (L->data[j] < L->data[j - 1])
				{
					tag = 0;
					temp = L->data[j - 1];
					L->data[j - 1] = L->data[j];
					L->data[j] = temp;
				}
			}
			low ++;
		}
		else
		{
			for (j = low; j < high; j++)
			{
				if (L->data[j] > L->data[j + 1])
				{
					tag = 0;
					temp = L->data[j + 1];
					L->data[j + 1] = L->data[j];
					L->data[j] = temp;
				}
			}
			high--;
		}
	}
}
//给定一组关键字，创建一个带头结点的链表，设计一个直接插入排序算法对这个单链表递增排序
void InsertSort(LinkList &L)
{
	LinkList pre, p, q, r;
	if (L&&L->next)
	{
		r = L->next;
		
		while (r->next)
		{
			pre = p = L->next;
			if (r->next->data < r->data)
			{
				while (p != r)
				{
					if (p->data < r->next->data)
					{
						pre = p;
						p = p->next;
					}
				}
				q = r->next;
				r->next = r->next->next;
				r = r->next;
				q->next = pre->next;
				pre->next = q;
			}
		}
	}
}