@@ -0,0 +1,1173 @@
+import java.util.Scanner;%0A%0Apublic class Solution%7B%0A    public static void main(String args%5B%5D)%7B%0A        Scanner s = new Scanner(System.in);%0A        int n = s.nextInt();%0A        int arr%5B%5D = new int%5Bn%5D;%0A        for(int i=0;i%3C=n-1;i++)%7B%0A            arr%5Bi%5D = s.nextInt();%0A        %7D%0A        Solution obj = new Solution();%0A        obj.sort(arr , 0 , n-1);%0A    %7D%0A    public void sort(int arr%5B%5D , int low ,int high)%7B%0A       if(low %3C high)%7B%0A           int partition_index = partition(arr , low , high);%0A           sort(arr , low , partition_index - 1);%0A           sort(arr , partition_index + 1 , high);%0A           %0A       %7D%0A   %7D%0A   public int partition(int arr%5B%5D , int low , int high)%7B%0A       int pivot = arr%5Bhigh%5D;%0A       int i = low - 1;%0A       for(int j = low ; j %3C=high-1 ;j++)%7B%0A           if(arr%5Bj%5D %3C= pivot)%7B%0A               i++;%0A               int temp = arr%5Bi%5D;%0A               arr%5Bi%5D = arr%5Bj%5D;%0A               arr%5Bj%5D = temp;%0A           %7D%0A       %7D%0A       int temp = arr%5Bi+1%5D;%0A       arr%5Bi+1%5D = arr%5Bhigh%5D;%0A       arr%5Bhigh%5D = temp;%0A       for(int z=0;z%3C=arr.length-1;z++)%7B%0A           System.out.print(arr%5Bz%5D+%22 %22);%0A       %7D%0A       System.out.println();%0A       return i + 1;%0A   %7D%0A%7D%0A

Create Solution.java