static void quick_sort (int lowerIndex, int higherIndex,int array[]) {
		      int i = lowerIndex;
	        int j = higherIndex;
	        // calculate pivot number, I am taking pivot as middle index number
	        int pivot = array[lowerIndex+(higherIndex-lowerIndex)/2];
	        // Divide into two arrays
	        while (i <= j) {
	            /**
	             * In each iteration, we will identify a number from left side which
	             * is greater then the pivot value, and also we will identify a number
	             * from right side which is less then the pivot value. Once the search
	             * is done, then we exchange both numbers.
	             */
	            while (array[i] < pivot) {
	                i++;
	            }
	            while (array[j] > pivot) {
	                j--;
	            }

	            if (i <= j) {
	            	int temp = array[i];
	    	        array[i] = array[j];
	    	        array[j] = temp;
	                //move index to next position on both sides
	                i++;
	                j--;
	            }
	        }
	       
	        
	        // call quickSort() method recursively
	        if (lowerIndex < j)
	            quick_sort(lowerIndex, j,array);
	        if (i < higherIndex)
	            quick_sort(i, higherIndex,array);
	        for (int j1:array) {
	    		System.out.print(j1+",");
	    	}
	        System.out.println();
	        
	   }