Search_Rotated_Sorted_Array

first accepted solution in leetcode.

A lot more work needs to be done to refine this code.

Mistakes I made:

1. If we use two conditions in the fist statement, it is a better idea
to list ALL possible combinations of them, simply using "else if" is not
sufficient.

2.  make sure to use "continue" when we captured a case .

3. if we use while( start < end ) , it's good idea to not use mid +/- 1,
instead we should use left = mid || right = mid, and always check if
start is right next to right, as terminating condition.