자료구조와 함께 배우는 알고리즘 입문[자바] - 6일차

03. 검색

 

연습문제 Q7

static class PhyscData {
    private String name;
    private int height;
    private double vision;
        
    public PhyscData(String name, int height, double vision) {
        this.name = name;
        this.height = height;
        this.vision = vision;
    }
    
    public String toString() {
        return name+", "+height+", "+vision;
    }
        
    public static final Comparator<PhyscData> VISION_ORDER = new VisionOrderComparator();
    
    private static class VisionOrderComparator implements Comparator<PhyscData> {
        @Override
        public int compare(PhyscData o1, PhyscData o2) {
            return (o1.vision > o2.vision) ? 1 : (o1.vision < o2.vision) ? -1 : 0;
        }
    }
}
 
public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
        
    PhyscData[] x = {
        new PhyscData("테스트1", 162, 0.3),
        new PhyscData("테스트2", 152, 1.3),
        new PhyscData("테스트3", 180, 1.9),
        new PhyscData("테스트4", 152, 2.0),
        new PhyscData("테스트5", 175, 1.5),
        new PhyscData("테스트6", 190, 1.8),
        new PhyscData("테스트7", 174, 0.2)
    };
        
    System.out.print("시력이 몇인 사람을 찾고 있나요? : ");
        
    double vision = sc.nextDouble();
    int idx = Arrays.binarySearch(x, new PhyscData("", 0, vision), PhyscData.VISION_ORDER);
        
    if(idx < 0) {
        System.out.println("요소가 없습니다.");
    }else{
        System.out.println("x["+idx+"]에 있습니다.");
        System.out.println("찾은 데이터 ::: "+x[idx]);
    }        
}