[Java] Quicksearch to inverse Quicksearch

public class QuickSort {

 static int partition(int x[], int left, int right) {
 int i = left;
 int j = right;
 int change;
 int pivot = x[(left + right) / 2];

 while (i <= j) {
 while (x[i] [highlight]>[/highlight] pivot) {
 i++;
 }
 while (x[j] [highlight]<[/highlight] pivot) {
 j--;
 }
 if (i <= j) {
 change = x[i];
 x[i] = x[j];
 x[j] = change;
 i++;
 j--;
 }
 }
 return i;
 }


 public static void normalSort(int x[], int left, int right) {
 int index = partition(x, left, right);
 if (left < index - 1) {
 normalSort(x, left, index - 1);
 }
 if (index < right) {
 normalSort(x, index, right);
 }
 }

 public static void printArray(int[] x) {
 for(int i = 0; i < x.length; i++) {
 System.out.print("[" + x[i] + "] ");
 }
 }

 public static void main(String[] args) {
 int[] qsa = {5,2,6,9,45,12,1,95};
 System.out.println("unsorted array:");
 printArray(qsa);
 System.out.println();
 System.out.println();
 System.out.println("sorted array:");
 normalSort(qsa, 0, qsa.length-1 );
 printArray(qsa);
 }

}