int getMax(int a[],  int left, int right) {     int i = left;     int j = right;     int max = a[i];     if (i == j)         return a[i];     while (i <= j)     {         int mid = (i + j) / 2;         if (mid > i&&mid < j)         {             if (a[mid]>a[mid - 1] && a[mid] > a[mid + 1])                 return a[mid];             else   if (a[mid]>a[mid - 1] && a[mid]<a[mid+1])             {                 i = mid + 1;             }             else  if (a[mid]<a[mid - 1] && a[mid]>a[mid + 1])             {                 j = mid - 1;             }         }         else if (mid == i&&mid == j)         {             return a[mid];         }         else if (mid == i&&mid<j)             return a[mid]>a[j] ? a[mid] : a[j];     } }