void quicksort(int **numbers, int left, int right, int loop)
{
int pivot, i, j, temp
 while(loop>=1){
  loop--;
 if (left < right)
    {
        i = left; 
        j = right + 1;
        pivot = numbers[loop][left];
        do
        { 
            do
            {
                i++;
            } while (numbers[loop][i] < pivot); 
            do
            {
                j--;
            } while (numbers[loop][j] > pivot);
            if (i < j)
                temp = numbers[loop][i];
    numbers[loop][i]=numbers[loop][j];
    numbers[loop][j]=temp;
        } while (i<j);
        temp=numbers[loop][left];
  numbers[loop][left]=numbers[loop][j];
  numbers[loop][j]=temp;
        quicksort(numbers, left, j - 1, loop+1);
        quicksort(numbers, j + 1, right, loop+1);
 }
    }
}    

일반적인 재귀 퀵정렬에 2차원 배열만 도입했을 뿐인데.. 도대체 왜 안되는지 모르겠네요..