[计算机]Java排序总结.doc

倒叙排序第一种利用一个数组来盛放后，再来倒叙输出public class daoxu public static void main(String args)int arr =2,4,6,8,7,1,3;int num =new intarr.length;for (int i = 0; i arr.length; i+) numi = arrarr.length - i - 1;numarr.length - i - 1 = arri;for (int i = 0; i num.length; i+) System.out.print( +numi+ );第二种利用一个变量来转换后，倒序输出public class daoxu public static void main(String argsint arr =2,4,6,87,13,15;for (int i = 0; i arr.length/2; i+) int temp = arri;arri =arrarr.length-i -1 ;arrarr.length-i -1 =temp; for(int i = 0;i arr.length;i+)System.out.print( arri + );冒泡排序（1.是将其升序排布）public class maopao public static void main(String args)int arr = 2,5,8,9,1,0,25;for (int i = 0; i arr.length; i+) for (int j = 0; j arrj，则其会降序输出if(arrj+1arrj)int temp = arrj;arrj = arrj+1;arrj+1 = temp;for (int i = 0; i arr.length; i+) System.out.print(arri+ );升序排列import java.util.Arrays;public class shengxu public static void main(String args)int arr = 1,5,0,2,10,4,78,9;Arrays.sort(arr);for (int i = 0; i arr.length; i+) System.out.print(arri+ );降序排列第一种先升序再降序import java.util.Arrays;public class jiangxu public static void main(String args)int arr =2,4,6,8,0,1,3,15,89,5;Arrays.sort(arr);for (int i = 0; i arr.length/2; i+) int temp = arri;arri=arrarr.length-i-1;arrarr.length-i-1= temp;for (int i = 0; i arr.length; i+) System.out.print(arri+ );第二种利用冒泡排序，然后再将其反向输出public class maopao public static void main(String args)int arr = 2,5,8,9,1,0,25;for (int i = 0; i arr.length; i+) for (int j = 0; j arr.length-i-1; j+) if(arrj+1=0; i-) System.out.print(arri+ );第三种利用冒泡排序的倒叙输出public class maopao public static void main(String args)int arr = 2,5,8,9,1,0,25;for (int i = 0; i arr.length; i+) for (int j = 0; j arrj)int temp = arrj