java二分查找法代码实现

public static int search(int[] a, int des) {
Arrays.sort(a);
int low = 0;
int upper = a.length - 1;
while (low <= upper) {
int desid = (low + upper) / 2;
if (a[desid] < des)
low = desid + 1;
else if (a[desid] > des)
upper = desid - 1;
else
return desid;
}
return -1;
}