打印设计模式实验2

《打印设计模式实验2》由会员上传分享，免费在线阅读，更多相关内容在工程资料-天天文库。

1、、类图代码：packagedm.adapterl;publicclassBinarySearch{publicDataOperatingAdapterdataOperatingAdapter;publicintbinarySearch(int[]num’intx){intlow=0;inthigh=num.length・l;while(low<=high){intmid=low+(high-low)/2;intmidVai=num[mid];if(x>midVal){low=mid+l;}elseif(x

2、idVal){high=mid}elseif(x==midVal){returnmid;}}return}}packagedm^adapterl;publicclassClient{publicstaticvoidmain(String[]args){tryDataOperationoperation;56,82,99};operation=(DataOperation)XMLUtil.getBean();int[]list={11,33,56,23,54,86,43,57,88,System•out•pni

3、ntIn(”Listbeforesort:”)；for(inti=0;i

4、sitionis:System.out.printIn(index);System.oi/t.println("Searchfor:11+number+J+index);}catch(Exceptione){e.printStackTrace();}}}packagedm.adapterl;publicclassDataOperatingAdapterimplementsDataOperationQuickSortquickSort=newQuickSort();BinarySearchbinarySea

5、rch=newBinarySearch();^Overridepublicvoidsort(int[]list){quickSort.quickSort(list);}^Overridepublicintsearch(int[]list，intnumber){returnbinarySearch>binarySearch(lisnumbe”)；}}packagedm.adapte";publicinterfaceDataOperation{voidsort(int[]list);intsearch(int[]

6、list，intnumber);}packagedm.adapterl;publicclassQuickSort{publicDataOperatingAdapterdataOperatingAdapter;publicint[]quicksort(int[]num){returnsort(nunum・length-1);}publicint[]sort(int[]num,intleft,intright){if(left

7、(true){while(i+l-l&&num[--j]>s);if(i>=j){break;}swap(num，i,j);}num[left]=num[j];num[j]=s;sort(num，left.,j-1);sort(num，j+1，right);}returnnum;}privatevoidswap(int[]num^inti，intj){intt;t=num[i];num[i]=num[j];num[j]=t;}}packag

8、edm.adapterl;importjava.io.File;importjavax•xml.parsers•DocumentBuilde”；importjavax.xml•parsers.DocumentBuilderFacto“y;importorg・w3c.dom・Document;importorg.w3c.dom.Node;importorg.w3c・dom.NodeList;publi