java數組排序的方法

這篇文章主要介紹“java數組排序的方法”，在日常操作中，相信很多人在java數組排序的方法問題上存在疑惑，小編查閱了各式資料，整理出簡單好用的操作方法，希望對大家解答”java數組排序的方法”的疑惑有所幫助！接下來，請跟著小編一起來學習吧！

 /**
         *將數組中的兩個指定下標的元素交換位置          
         *@param arr 要交換元素的數組引用地址值
         *@param a 數組索引
         *@param b 數組索引
         */
         private static void swap(int[] arr,int a,int b){
                        int temp=arr[a];
                        arr[a]=arr[b];
                        arr[b]=temp;
         }
         /**
         *冒泡排序
         *@param arr 將要排序的數組引用地址值
         *@param type true表示順序排序,false表示逆序排序
         */
         public static void bubbleSort(int[] arr, boolean type){                
                 if(type){
                          for(int i=0;i<arr.length-1;i++){
                                for(int j=0;j<arr.length-1-i;j++){
                                                if(arr[j]>arr[j+1]){
                                                        swap(arr,j,j+1);
                                                }
                                }
                        }
                 }else{
                                for(int i=0;i<arr.length-1;i++){
                                        for(int j=0;j<arr.length-1-i;j++){
                                                if(arr[j]<arr[j+1]){
                                                        swap(arr,j,j+1);
                                                }
                                        }
                                }
                 }
         }
          /**
         *選擇排序
         *@param arr 將要排序的數組引用地址值
         *@param type true表示順序排序,false表示逆序排序
         */
         public static void selectSort(int[] arr,boolean type){
                 if(type){
                         for(int i=0;i<arr.length-1;i++){
                                 for(int j=i;j<arr.length;j++){
                                         if(arr[i]>arr[j]){
                                                 swap(arr,i,j);
                                         }
                                 }
                         }
                 }else{
                         for(int i=0;i<arr.length-1;i++){
                                 for(int j=i;j<arr.length;j++){
                                         if(arr[i]<arr[j]){
                                                 swap(arr,i,j);
                                         }
                                 }
                         }
                 }
         }        
         /**
         *快速排序
         *@param arr 將要排序的數組引用地址值
         *@param l 數組索引的初始位置
         *@param r 數組的長度-1
         *@param type true表示順序排序,false表示逆序排序
         */
         public static void  quicklySort(int[] arr,int l,int r,boolean type){
                         if(l<r){
                                int i=l,j=r,x=arr[i];
                                if(type){
                                         while(i<j){
                                                while(i<j&&arr[j]>x)
                                                        j--;
                                                if(i<j)
                                                        arr[i++]=arr[j];
                                                while(i<j&&arr[i]<x)
                                                        i++;
                                                if(i<j)
                                                        arr[j--]=arr[i];
                                        }
                                }else{
                                         while(i<j){
                                                while(i<j&&arr[j]<x)
                                                        j--;
                                                if(i<j)
                                                        arr[i++]=arr[j];
                                                while(i<j&&arr[i]>x)
                                                        i++;
                                                if(i<j)
                                                        arr[j--]=arr[i];
                                        }
                                }
                                arr[i]=x;
                                quicklySort(arr,l,r-1,type);
                                quicklySort(arr,l+1,r,type);
                        }
        }

到此，關于“java數組排序的方法”的學習就結束了，希望能夠解決大家的疑惑。理論與實踐的搭配能更好的幫助大家學習，快去試試吧！若想繼續學習更多相關知識，請繼續關注億速云網站，小編會繼續努力為大家帶來更多實用的文章！