JAVA冒泡、插入、选择排序算法

1、importjava.io.*;publicclassPaixu/冒泡排序法publicvoidMaopao(inta)for(inti=1;i<a.length;i+)for(intj=0;j<a.length-i;j+)if(aj>aj+1)inttemp=aj+1;aj+1=aj;aj=temp;System.out.println("n"+"采用冒泡排序法：");/插入排序法：publicvoidCharu(inta)for(inti=1;i<a.length;i+)for(intj=0;j<i;j+)if(aj&g

2、t;ai)inttemp=ai;for(intk=i;k>j;k-)ak=ak-;aj=temp;System.out.println("n"+"采用插入排序法：");/选择排序法：publicvoidXuanze(inta)for(inti=0;i<a.length;i+)intposition=i;for(intj=i+1;j<a.length;j+)if(aposition>aj)inttemp=aposition;aposition=aj;aj=temp;System.out.println("n"+&

3、quot;采用选择排序法：");publicvoidPrint(inta)System,out.println("从小至U大排序结果为：");for(inti=0;i<a.length;i+)System.out.print(ai+",");publicstaticvoidmain(Stringargs)inta=newint5;Paixupx=newPaixu();BufferedReaderbuf=newBufferedReader(newInputStreamReader(System.in);System,out.println(

4、"请输入五个整数：");for(inti=0;i<a.length;i+)tryStrings=buf.readLine();intj=Integer.parseInt(s);ai=j;catch(Exceptione)System.out.println(”出错了！必须输入整数，请重新输入!");i-;System,out.println(”您输入的整数依次为：”)；for(inti=0;i<a.length;i+)System.out.print(ai+",");System.out.println("n"+

5、"px.Maopao(a);/调用冒泡算法px.Print(a);System.out.println("n"+"");px.Charu(a);/调用插入算法px.Print(a);System.out.println("n"+"");px.Xuanze(a);/调用选择算法px.Print(a);Java实现二分査找2008-11-1921:38今天阿朗被问到二分查找竟然一着急没写出来。faint=。=回来复习下importjava,util.*;publicclassBinarySearchpubli

6、cstaticvoidmain(Stringargs)ArrayListInteger>a=newArrayListInteger()；addIntegerInSequence(a,l,10);print(a);intpos=binarySearch(a,10);if(pos!=-1)System.out.print("Elementfound:"+pos);elseSystem.out.print("Elementnotfound");/*二分查找法* parama* paramvalue待查找元素*return*/publicstaticint

7、binarySearch(ArrayListIntegera,intvalue)intsize=a.size();intlow=0,high=size-1;intmid;while(low<=high)mid=(low+high)/2;if(a.get(mid)<value)low=low+1;elseif(a.get(mid)>value)high=high-1;elsereturnmid;returnT;/*填充顺序元素到数组* parama* parambegin开始元素* paramsize大小*/publicstaticvoidaddIntegerInSequenc

8、e(ArrayListInteger>a,intbegin,intsize)for(inti二begin;i<begin+size;i+)a.add(i);/*打印数组* parama*/publicstaticvoidprint(ArrayListIntegera)IteratorInteger>i=a.iterator();while(i.hasNext()System.out.print(i.next()+"""");System.out.println("""");/JAVA库中的二分查找使用非递归方式实现，返回结果与前面写的有所不同：找不到时返回的是负数，但不一定是-1privatestaticintbinarySearch0(inta,intfromIndex,inttoIndex,intkey)intlow=fromIndex;inthigh=toIndex-1;while(low=high)in