// Decompiled by JEB v0.9.0 alpha

public static void quicksort(int[] arg5, int arg6, int arg7) {
    int v0 = arg6;
    int v1 = arg7;
    int v2 = arg5[(arg7 - arg6) / 2 + arg6];
    while(v0 <= v1) {
        while(arg5[v0] < v2) {
            ++v0;
        }

        while(arg5[v1] > v2) {
            --v1;
        }

        if(v0 > v1) {
            continue;
        }

        int v3 = arg5[v0];
        arg5[v0] = arg5[v1];
        arg5[v1] = v3;
        ++v0;
        --v1;
    }

    if(arg6 < v1) {
        Sort.quicksort(arg5, arg6, v1);
    }

    if(v0 < arg7) {
        Sort.quicksort(arg5, v0, arg7);
    }
}

// Decompiled by JD-GUI v0.3.5

public static void quicksort(int[] paramArrayOfInt, int paramInt1, int paramInt2)
{
  int i = paramInt1;
  int j = paramInt2;
  int k = paramArrayOfInt[(paramInt1 + (paramInt2 - paramInt1) / 2)];
  if (i > j)
  {
    if (paramInt1 < j)
      quicksort(paramArrayOfInt, paramInt1, j);
    if (i < paramInt2)
      quicksort(paramArrayOfInt, i, paramInt2);
    return;
  }
  while (paramArrayOfInt[i] < k)
    i++;
  while (true)
  {
    if (paramArrayOfInt[j] <= k)
    {
      if (i > j)
        break;
      int m = paramArrayOfInt[i];
      paramArrayOfInt[i] = paramArrayOfInt[j];
      paramArrayOfInt[j] = m;
      i++;
      j--;
      break;
    }
    j--;
  }
}