JAVA数据算法.doc

一、/*冒泡排序*/public class BubbingSort public static void main(String args) int arr=2,1,4,5,3;/一共有arr.length-1循环for(int i=1;iarr.length;i+)/每轮循环有arr.lengrh-i次循环for(int j=0;jarrj+1)int temp=arrj;arrj=arrj+1;/将j+1的数和j的数替换位置arrj+1=temp;for(int i=0;iarr.length;i+)System.out.print(arri+ );二、/*快速排序*/public class QuickSortpublic static void QuickSort(int stru, int left, int right) if(leftright)int i=left,j=right;int X=strui;int n=i;while(ij)while(Xi)j-;strun=struj;n=j;while(Xstrui & ij)i+;strun=strui;n=i;strui=X;QuickSort(stru,left,j-1); / 对左边进行递回QuickSort(stru,j+1,right); / 对右边进行递回public static void main(String args) int stru=10,89,76,35,84,47,62,75,68;System.out.println(快速排序之前：);for(int k=0;kstru.length;k+)System.out.print(struk+ );QuickSort(stru,0,stru.length-1);System.out.println(n快速排序之后：);for(int k=0;kstru.length;k+)System.out.print(struk+ );三、/*选择排序算法*/public class SelectSort public static void main(String args) int score=5,4,9,8,3;for(int i=1;iscore.length;i+)/首先定义一个最大数下标int index=score.length-i;for(int j=0;jscoreindex) /找出每轮循环的最大值index=j;int temp =scorescore.length-i;scorescore.length-i=scoreindex;scoreindex=temp;for(int i=0;iscore.length;i+)System.out.print(scorei+ );四、/*插入排序*/public class InsertSort private static int count = 0;public static void printAll(int a) System.out.println(第 + (+count) + 次：);for (int i = 0; i a.length; i+) System.out.print(ai + );System.out.println();public static void Sort(int data) /从第二个元素开始for (int i = 1; i 0; j-) if (dataj - 1 dataj) int temp = 0;temp = dataj - 1;dataj - 1 = dataj;dataj = temp;printAll(data);public static void main(String args) int data = new int10;for (int i = 0; i data.length; i+) datai = (int) (Math.random() * 100);System.out.println(排序之前：);for (int i : data) System.out.print(i + );System.out.println();System.out.println(排序之后：);Sort(data);五、/*逆排序*/public class NiSort public static void main(String args) int a = 4,1,3,5,9,2,1; int len = a.length - 1; int temp; for ( int i = 0; i len; i+,len-) temp = ai; ai = alen; alen = temp; for ( int j = 0; j a.length; j+) System.out.print(aj+ ); /*逆序递归算法*/一对int型进行逆序递归public class Reversal public static int revertsal(int rs,int i,int num)if(i 0)/ / StringBuilder sb = new StringBuilder(s);/ for(int index = s - 1; index = 0; index-)/ / sb.append(str.charAt(index);/charAt返回指定索引处的 char 值/ / String outputString = sb.toString();/ / StringBuffer st = new StringBuffer(s);/ for(int index=s-1;index=0;index-)/ st.append(str.charAt(index);/ charAt返回指定索引处的 char 值/ / String outputString = st.toString();/ / System.out.println(逆序递归前的字符串:);/ System.out.println(str);/ System.out.println(逆序递归后的字符串:);/ System.out.println(outputString);/ / 6、 /*折半（二分查找）*/public class BinarySearch public static void find(int leftIndex,int rightIndex,int val,int arr)/首先找到中间的数int midIndex=(rightIndex+leftIndex)/2;int midVal=arrmidIndex;if(rightIndex=leftIndex)/如果要找的数比midVal大if(midValval)/在arr左边数中找find(leftIndex,midIndex-1,val,arr);else if(midValval)/在arr的右边去查找find(midIndex+1,rightIndex,val,arr);else if(midVal=val)System.out.println(找到下标+midIndex);elseSystem.out.println(没有该数!);public static void main(String