//线性表链接
void ListMerge(SqList &L1, SqList &L2, SqList &L)
{
	int p = 0;
	int i = 0, j = 0;
	while (i != L1.length)
	{
		ListInsert_Sq(L, p++, L1.elem[i++]);
	}
	while (j != L2.length)
	{
		ListInsert_Sq(L, p++, L2.elem[j++]);
	}
}
//接下来的三个函数实现快速排序
//此函数确定中间值，以便下次排序使用
int Partition(SqList &L, int low, int high)
{
	ElemType p = L.elem[low];
	ElemType pivotkey = L.elem[low];
	while (low < high)
	{
		while (low < high&&L.elem[high] >= pivotkey)
			--high;
		L.elem[low] = L.elem[high];
		while (low < high&&L.elem[low] <= pivotkey)
			++low;
		L.elem[high] = L.elem[low];
	}
	L.elem[low] = p;
	return low;
}

//快速排序递归使用
void Qsort(SqList &L,int low,int high)
{
	if (low< high)
	{
		int pivotloc = Partition(L, low, high);
		Qsort(L, low, pivotloc - 1);
		Qsort(L, pivotloc + 1, high);
	}
}

void QuickSort(SqList &L)
{
	Qsort(L, 0, L.length - 1);
}