public int findElement(int[] arrA, int element) {
		int low = 0;
		int high = arrA.length - 1;
		while (low <= high) {
			int mid = (low + high) / 2;
			if (arrA[mid] == element) {
				return mid;
			}
			if (arrA[mid] >= arrA[low]) {
				if (arrA[mid] > element && arrA[low] <= element) {
					//means first half is in strictly increasing order
					high = mid - 1;
				} else {
//					if you are here means array has rotation in the second half of the array
					low = mid + 1;
				}
			} else {
				//if you are here means array has rotation in the first half of the array
				if (arrA[mid] < element && arrA[high] >= element) {
//					means second half is in strictly increasing order
					low = mid + 1;
				} else {
					high = mid - 1;
				}
			}
		}
		return -1;
	}