public int findPivot(int array[], int start, int end) {
			int mid = (start+end)/2;
			if(mid<end && array[mid] > array[mid+1])
				return mid;
			else if(mid>start && array[mid] < array[mid-1])
				return mid-1;
			else if(array[mid] < array[start])
				return findPivot(array, start, mid-1);
			else if(array[mid] > array[end]) 
				return findPivot(array, mid, end);
			else return -1;
	}