java日常学习:直接排序与冒泡排序

来源:互联网 发布:网络推广部职能 编辑:程序博客网 时间:2024/05/22 04:55

java代码段


java直接排序

class demo1{    public static void main(String[] args){        int[] arr = {10,485,54,27,3,4,79,45};        paiXv(arr);    }    //下面是直接排序函数;    public static void paiXv(int arr[]){        for (int i=0;i<arr.length-1 ;i++ ){            for (int j=1+i;j<arr.length ;j++ ){                if (arr[j]>arr[i]){                    int temp = arr[i];                    arr[i] = arr[j];                    arr[j] = temp;                }            }        }        for (int i=0;i<arr.length ;i++ ){   //遍历数组;            System.out.print(arr[i]+",");        }    }}

java冒泡排序

    class demo8{    public static void main(String[] args){         int[] arr = {10,56,1,5,46,41,74,12,3,78};        maoPao(arr);    //调用maoPao函数;    }    //下面是冒泡排序函数;    public static void maoPao(int arr[]){        for (int i=0;i<arr.length-1 ;i++ ){     //外层循环控制着循环趟数;            for (int j=0;j<arr.length-1-i ;j++ ){   //内层循环控制着每一趟循环多少次;                int temp=0;                if (arr[j]>arr[j+1]){                    temp = arr[j+1];                    arr[j+1] = arr[j];                    arr[j] = temp;                }            }        }        for (int i = 0;i<arr.length ;i++ ){ //遍历数组;            System.out.print(arr[i]+",");        }    }}

*用于平时自己复习回顾,如有错误,欢迎指正

阅读全文
0 0