对于排序,Java中的Arrays类提供了sort()方法,对于二分法,Java中的Arrays类提供了binarySearch()方法。这些用起来都很方便。
import static java.util.Arrays.binarySearch;
public class ArrayTest07 {
public static void main(String[] args) {
int[] arr ={65,43,7,89,31,576,12,45,68,32,14,34};
int[] arr1 ={65,43,7,89,31,576,12,45,68,32,14,34};
for(int i=0;i<arr.length;++i){
System.out.print(arr[i]+" ");
}
System.out.println();
System.out.println("=======================");
mysort1(arr);
mysort2(arr1);
for(int i=0;i<arr.length;++i){
System.out.print(arr[i]+" ");
}
System.out.println();
for(int i=0;i<arr.length;++i){
System.out.print(arr1[i]+" ");
}
System.out.println();
int indx=mySearch(arr,0,12,31);
int indx1=binarySearch(arr,31);
System.out.println((indx==-1)?"该元素不存在,":"该元素的下标:"+indx);
System.out.println((indx1==-1)?"该元素不存在,":"该元素的下标:"+indx1);
}
//冒泡算法
public static void mysort1(int[] arr){
for(int i=0;i<arr.length-1;i++){
for(int j=0;j<arr.length-i-1;j++){
if(arr[j]>arr[j+1]){
int temp=arr[j];
arr[j]=arr[j+1];
arr[j+1]=temp;
}
}
}
}
//选择排序
public static void mysort2(int[] arr){
int temp=0;
for(int i=0;i<arr.length;++i){
int indx=i;
for(int j=i+1;j<arr.length;++j){
if(arr[j]<arr[indx]){
indx=j ;
}
}
temp=arr[i];
arr[i]=arr[indx];
arr[indx]=temp;
}
}
//二分法查找,针对有序数组,返回被查找元素的下标,没有返回-1
public static int mySearch(int[] arr,int begin,int end, int dest){
while(begin<=end){
int mid=(begin+end)/2;
if (dest==arr[mid]){
return mid;
}else if(dest<arr[mid]) {
end = mid - 1;
}else {
begin = mid+1;
}
return mySearch(arr,begin,end,dest);
};
return -1;
}
}