@@ -0,0 +1,1222 @@
+import java.util.*;%0A%0Aclass QuickSort%0A%7B%0A    int partition(int arr%5B%5D, int low, int high)%0A    %7B%0A        int pivot = arr%5Bhigh%5D; %0A        int i = (low-1);%0A        for (int j=low; j%3Chigh; j++)%0A        %7B%0A            if (arr%5Bj%5D %3C= pivot)%0A            %7B%0A                i++;%0A %0A                // swap arr%5Bi%5D and arr%5Bj%5D%0A                int temp = arr%5Bi%5D;%0A                arr%5Bi%5D = arr%5Bj%5D;%0A                arr%5Bj%5D = temp;%0A            %7D%0A        %7D%0A %0A        int temp = arr%5Bi+1%5D;%0A        arr%5Bi+1%5D = arr%5Bhigh%5D;%0A        arr%5Bhigh%5D = temp;%0A %0A        return i+1;%0A    %7D%0A %0A    void sort(int arr%5B%5D, int low, int high)%0A    %7B%0A        if (low %3C high)%0A        %7B%0A            int pi = partition(arr, low, high);%0A%0A            sort(arr, low, pi-1);%0A            sort(arr, pi+1, high);%0A        %7D%0A    %7D%0A %0A    static void printArray(int arr%5B%5D)%0A    %7B%0A        int n = arr.length;%0A        for (int i=0; i%3Cn; ++i)%0A            System.out.print(arr%5Bi%5D+%22 %22);%0A        System.out.println();%0A    %7D%0A %0A    public static void main(String args%5B%5D)%0A    %7B%0A        int arr%5B%5D = %7B10, 7, 8, 9, 1, 5%7D;%0A        int n = arr.length;%0A %0A        QuickSort ob = new QuickSort();%0A        ob.sort(arr, 0, n-1);%0A %0A        System.out.println(%22sorted array%22);%0A        printArray(arr);%0A    %7D%0A%7D%0A

Create QuickSort.java