33.c

#include<stdio.h>

intsearch(intA[], intn, inttarget) {
intl, r, m;
l=0;
r=n-1;
while (l <= r) {
m= (l+r) / 2;
if (A[m] ==target) returnm;

if (A[l] <= A[m]) { /* left half is sorted */
if (A[l] <= target&&target<A[m]) { /* target in left half */
r=m-1;
 }
else {
l=m+1;
 }
 }
else { /* right half is sorted */
if (A[m] <target&&target <= A[r]) { /* target in right half */
l=m+1;
 }
else {
r=m-1;
 }
 } 
 }
return-1;
}

intmain() {
intnum[] = { 1, 3, 5 };
/* should be 0 */
printf("%d\n", search(num, sizeof(num)/sizeof(num[0]), 1));
return0;
}