旋转数组查找数字k

在一个旋转数组中找到一个数字k:
public class Main {
int count=1;
public static void main(String[] args) {
// TODO Auto-generated method stub
int[] temp={7,8,9,1,2,3,4,5,6};
int a=Find(temp,2);
System.out.println(a);
}
public static int Find(int[] input,int k){
int index=0;
int lo=0;
int hi=input.length-1;
while(lo=input[mid] && k<=input[hi])
lo=mid+1;
else
hi=mid-1;
}else{//左侧有序
if(k=input[lo])
hi=mid-1;
else
lo=mid+1;
}
}
return -1;
}
}