private int partitionIt(int start,int end,int pivot){
		
		int leftptr=start-1;
		int rightptr=end;
		
		while(true){
			
			//array[leftptr] is always >=pivot, so switch end with leftptr
			while(array[++leftptr]<pivot){
				System.out.println(array[leftptr]+ " :: "+pivot);
			}
				
			//array[rightprt] is not
			while(array[--rightptr]>pivot&&rightptr>leftptr)
				;
			if(leftptr>=rightptr)
				break;
			
			int temp=array[leftptr];
			array[leftptr]=array[rightptr];
			array[rightptr]=temp;			
		}
		int temp=array[leftptr];
		array[leftptr]=array[end];
		array[end]=temp;
		return leftptr;
	}