Quick Sort Code

public class Solution {
	
	public static void quickSort(int[] input) {
		/* Your class should be named Solution
		 * Don't write main().
		 * Don't read input, it is passed as function argument.
		 * No need to print or return the output.
		 * Taking input and printing output is handled automatically.
		 */
		quickSort(input,0,input.length-1);
	}
    public static int partition(int[]input,int si,int ei){
        
        int pivot=input[si];
        int count=0;
        for(int i=si+1;i<=ei;i++){
            if(input[i]<=pivot){
                count++;
            }
        }
        int pivotpos=si+count;
        int temp=input[pivotpos];
        input[pivotpos]=pivot;
        input[si]=temp;
        int i=si;
        int j=ei;
        while(i<pivotpos && j>pivotpos){
            if(input[i]<=pivot){
                i++;
            }
            else{
                  if(input[j]>pivot){
                      j--;
                  }else{
                    int temp1=input[i];
                    int temp2=input[j];
                    input[i]=temp2;
                    input[j]=temp1;
                }   
            }
        }
        return pivotpos;
    }
    public static void quickSort(int [] input,int si,int ei){
        if(si>=ei){
            return;
        }
        int pidx=partition(input,si,ei);
        quickSort(input,si,pidx-1);
        quickSort(input,pidx+1,ei);
    }
	
}