public static void QuickSort(int[] numbers, int left, int right)
      {
         int i = left;
         int j = right;

         int pivot = numbers[(left + right) / 2];
         while (true) {
            while (data[i] < pivot){
               i++;
			}
            while (pivot < data[j]){
               j--;
			}
            while (i <= j) {
               int temp = numbers[i];
               numbers[i] = numbers[j];
               numbers[j] = temp;
               i++;
               j--;
            }
            if (i > j){
               break;
			}
         }
         if (l < j){
            QuickSort(numbers, l, j);
			}
         if (i < r){
           QuickSort(numbers, i, r);
			}
      }