public int getMinRecur(int front, int rear){
 
		//base case
		if(front == rear||rear-front==1)
		{
			if(arr[front] > arr[rear]){
				System.out.println("min: "+arr[rear]);
			}else{
				System.out.println("min: "+arr[front]);
			}
			
			return -1;
		}

		
		int middle = (rear+front)/2;
 
		if(arr[front] > arr[middle]){
			//min in the left part, including middle
			getMin(front,middle);
		}else{
			//right part
			getMin(middle,rear);
		}
		
		
		return -1;
	}