打印设计模式实验2.docVIP

一、类图 代码： package dm.adapter1; public class BinarySearch { public DataOperatingAdapter dataOperatingAdapter; public int binarySearch(int[] num,int x){ int low=0; int high=num.length-1; while(low=high){ int mid=low+(high-low)/2; int midVal=num[mid]; if(xmidVal){ low=mid+1; }else if(xmidVal){ high=mid-1; }else if(x==midVal){ return mid; } } return -1; } } package dm.adapter1; public class Client { public static void main(String[] args) { try { DataOperation operation; operation = (DataOperation) XMLUtil.getBean(); int[] list = { 11, 33, 56, 23, 54, 86, 43, 57, 88, 56, 82, 99 }; System.out.println(List before sort: ); for (int i = 0; i list.length; i++) { System.out.print(list[i] + ); } operation.sort(list); System.out.println(\nList after sort: ); for (int i = 0; i list.length; i++) { System.out.print(list[i] + ); } int number = 99; int index = operation.search(list, number); System.out.println(index); System.out.println(\nSearch for: + number + , Position is: + index); } catch (Exception e) { e.printStackTrace(); } } } package dm.adapter1; public class DataOperatingAdapter implements DataOperation { QuickSort quickSort=new QuickSort(); BinarySearch binarySearch=new BinarySearch(); @Override public void sort(int[] list) { quickSort.quickSort(list); } @Override public int search(int[] list, int number) { return binarySearch.binarySearch(list, number); } } package dm.adapter1; public interface DataOperation { void sort(int[] list); int search(int[] list,int number); } package dm.adapter1; public class QuickSort { public DataOperatingAdapter dataOperatingAdapter; public int[] quickSort(int[] num){ return sort(num,0,num.length-1); } public int[] sort(int[] num,int left,int right){ if(leftright){ int s=num[left