Recursion-Quick Sort - Problem Statement

Sort an array A using Quick Sort.
Change in the input array itself. So no need to return or print anything.


Input format :
Line 1 : Integer n i.e. Array size
Line 2 : Array elements (separated by space)
Output format :
Array elements in increasing order (separated by space)
Constraints :
1 <= n <= 10^3
Sample Input 1 :
6 
2 6 8 5 4 3
Sample Output 1 :
2 3 4 5 6 8
Sample Input 2 :
5
1 5 2 7 3
Sample Output 2 :
1 2 3 5 7 
]
****************************Code*******************************
public static void quickSort(int[] input, int sI, int eI) {
		
			if(sI>=eI)
           		return;
        
      int pivotPos=partition(input,sI,eI);
      quickSort(input,sI,pivotPos-1);
      quickSort(input,pivotPos+1,eI);
		}
    
		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[sI];
			input[sI]=input[pivotPos];
			input[pivotPos]=temp;
			int i=sI;
			int j=eI;
			while(i<pivotPos && j>pivotPos)
			{
				if(input[i]<=input[pivotPos])
					i++;
				else if(input[j]>input[pivotPos])
					j--;
				else
				{
					int temp_=input[i];
					input[i]=input[j];
					input[j]=temp_;
					i++;j--;
					
				}
			}
			return pivotPos;
		}
	
		public static void quickSort(int[] input) {
			
			quickSort(input, 0, input.length - 1);
		}