Reason for 2 parts in help rahul -pivot

#1

It is said here that in rotated array 4 5 1 2 3, we need to find mid point twice and check id a[start]<a[mid].
But, why twice? In first case, i.e 4 5, how will a[start] be < a[mid]

#2

@sonalbera we are calculating mid only once to check which part it is in then finding the key and reducing the search space accordingly