快排递归转非递归算法
QSort(L, low, high)
{
while(low < high)
{
pivotkey = partition(L, low, high);
QSort(L, low, pivotkey - 1);
QSort(L, pivotkey + 1, high);
}
}

求该代码转非递归算法