public static  int findPosition(int[] arr, int l, int r,int searchItem) {
		if(l==r) {
			if(arr[l] == searchItem) {
				return l;
			} else {
				return -1;
			}
		}
		
		int mid = (l+r)/2;
		if(arr[l] <= searchItem && searchItem <= arr[mid]) {
			return findPosition(arr, l, mid, searchItem);
		} else if(arr[mid+1] <= searchItem && searchItem <= arr[r]) {
			return findPosition(arr, mid+1, r, searchItem);
		} else if((arr[mid] >= searchItem && arr[l] > arr[r])) {
			return findPosition(arr, l, mid, searchItem); 
		} else {
	//	} else if(arr[mid+1] >=searchItem && arr[l]>arr[r]) {
			return findPosition(arr, mid+1, r, searchItem);
		}
		
	}