java数组排序的方法

这篇文章主要介绍“java数组排序的方法”，在日常操作中，相信很多人在java数组排序的方法问题上存在疑惑，小编查阅了各式资料，整理出简单好用的操作方法，希望对大家解答”java数组排序的方法”的疑惑有所帮助！接下来，请跟着小编一起来学习吧！

创新互联主要从事网站建设、成都做网站、网页设计、企业做网站、公司建网站等业务。立足成都服务十堰,10余年网站建设经验,价格优惠、服务专业,欢迎来电咨询建站服务:18982081108

 /**
         *将数组中的两个指定下标的元素交换位置          
         *@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数组排序的方法”的学习就结束了，希望能够解决大家的疑惑。理论与实践的搭配能更好的帮助大家学习，快去试试吧！若想继续学习更多相关知识，请继续关注创新互联网站，小编会继续努力为大家带来更多实用的文章！

文章名称：java数组排序的方法
路径分享：https://www.cdcxhl.com/article6/jocsog.html

成都网站建设公司_创新互联，为您提供网站收录、企业建站、做网站、云服务器、网站设计、用户体验

广告

声明：本网站发布的内容（图片、视频和文字）以用户投稿、用户转载内容为主，如果涉及侵权请尽快告知，我们将会在第一时间删除。文章观点不代表本网站立场，如需处理请联系客服。电话：028-86922220；邮箱：631063699@qq.com。内容未经允许不得转载，或转载时需注明来源： 创新互联