public class Demo{
public static void main(String[] args){
int a[] = {28,39,49,78,23};
int x = 49;
//下面是最簡單的冒泡排序
int temp;
for(int i=0; i<a.length;++i){
for(int j=a.length-1;j>i;--j){
if(a[j] <a[j-1]){
temp = a[j];
a[j] = a[j-1];
a[j-1] = temp;
}
}
}
System.out.println("排序完成：");
for(int emp:a){
System.out.print(emp+" ");
}
//下面是二分法查找(折中查找)
int first = 0;
int last = a.length-1;
int mid;
while(first<=last){
mid = (first+last)/2;
if(a[mid]==x){
System.out.println("\n查找到x，在數組的第"+(mid+1)+"位");
break;
}
if(a[mid]>x)
last = mid-1;
if(a[mid]<x)
first = mid+1;
}
}
}