挑战程序设计竞赛（算法和数据结构）——5.5迭代器和二分查找的java实现

迭代器代码：

import java.util.Arrays;
import java.util.Iterator;

public class IteratorDemo {
    public static void main(String[] args) {
        int[] arr = new int[]{1,2,3,4,5,6,7,8,9,8,2,6,5,7,1,3,4,5,6};
        Iterator iter = Arrays.stream(arr).iterator();
        while (iter.hasNext()){
            int element = iter.next();
            System.out.println(element);
        }
    }
}

二分查找代码：

import java.lang.reflect.Array;
import java.util.Arrays;

public class BInarySearchDemo {
    public static void main(String[] args) {
        int[] arr = new int[]{2,6,9,7,12};
        int a = 7;
        Arrays.sort(arr);
//        System.out.println(Arrays.binarySearch(arr, a));//返回的是查找到的值的索引下标
        if(Arrays.binarySearch(arr, a)>=0){System.out.println("yes");}
        else{
            System.out.println("no");
        }
    }
}