Java数组操作

public class ArrayTest {
	public static void  main(String[] args) {
    		String[] arr=new String[] {"云","边","有","个","小","卖","部"};
//    		数组的复制
    		String[] arr1=new String[arr.length];
    		for(int i=0;i<arr1.length;i++) {
    			arr1[i]=arr[i];	
    		}
//    		数组的反转
    		for(int i=0;i<arr.length/2;i++) {
    			String arr2=arr[i];
    			arr[i]=arr[arr.length-i-1];
    			arr[arr.length-i-1]=arr2;
    			}
    		for(int i=0;i<arr.length;i++) {
    			System.out.print(arr[i]+"\t");
    		}
    		System.out.println();
//          数组的查找（线性查找）
    		String dest="有";
    		boolean biaoshi=true;
    		for(int i=0;i<arr.length;i++) {
                if(dest.equals(arr[i])) {
                	System.out.println("找到了指定元素，位置为："+i);
                	biaoshi=false;
                	break;
                }
                
    		}
    		if(biaoshi) {
    			System.out.println("未找到");
    		}
    		//二分法查找
    		int[] num=new int[] {1,2,3,47,56,65,73,84,96};
    		int dest2=65;
    		int head=0;
    		int end=num.length-1;
    		boolean isFlag=true;
    		while(head <=end) {
    			int middle =(head+end)/2;
    			if(dest2==num [middle]) {
    				System.out.println("找到了指定元素，位置为："+middle);
    				isFlag=false;
    			    break;
    				}else if(dest2>num [middle]) {
    					head=middle+1;
    					}else {
    					end=middle-1;
    					}
    				}
    		if(isFlag) {
    			System.out.println("很遗憾，未找到");
    		}
    		
    		
}
}