Search in Rotated Sorted Array II

 1 class Solution {
 2 public:
 3     bool search( int A[], int n, int target ) {
 4         int start = 0, end = n-1;
 5         while( start <= end ) {
 6             int middle = ( start + end ) / 2;
 7             if( A[middle] == target || A[start] == target || A[end] == target ) { return true; }
 8             if( A[start] < A[end] ) {
 9                 if( A[middle] < target ) {
10                     start = middle + 1;
11                     --end;
12                 } else {
13                     end = middle - 1;
14                     ++start;
15                 }
16             } else if( A[start] > A[end] ){
17                 if( A[middle] < target ) {
18                     if( target > A[start] && A[middle] < A[start] ) {
19                         end = middle - 1;
20                         ++start;
21                     } else {
22                         start = middle + 1;
23                         --end;
24                     }
25                 } else {
26                     if( target < A[start] && A[middle] >= A[start] ) {
27                         start = middle + 1;
28                         --end;
29                     } else {
30                         end = middle - 1;
31                         ++start;
32                     }
33                 }
34             } else {
35                 ++start; --end;
36             }
37         }
38         return false;
39     }
40 };