快速排序

最新推荐文章于 2021-11-19 16:57:43 发布

geyueguiDai

最新推荐文章于 2021-11-19 16:57:43 发布

阅读量66

点赞数

分类专栏：数据结构和算法

本文链接：https://blog.csdn.net/weixin_36593769/article/details/110304318

版权

数据结构和算法专栏收录该内容

10 篇文章 0 订阅

订阅专栏

   public static void quickSort(int[] arrs,int left,int right){
       int leftindex=left;
       int rightindex=right;
       int privot=arrs[left+right]/2;
       while (leftindex<rightindex){
           while (arrs[leftindex]<privot){
               leftindex++;
           }
           while (arrs[rightindex]>privot){
               rightindex++;
           }
           arrs[leftindex]=arrs[leftindex]+arrs[rightindex];
           arrs[rightindex]=arrs[leftindex]-arrs[rightindex];
           arrs[leftindex]=arrs[leftindex]-arrs[rightindex];
           if(arrs[leftindex]==privot){
               rightindex++;
           }
           if(arrs[rightindex]==privot){
               leftindex++;
           }
       }
       if(leftindex==rightindex){
           leftindex++;
           rightindex++;
       }
       if(left<rightindex){
           quickSort(arrs,left,rightindex);
       }
       if(right>leftindex){
           quickSort(arrs,leftindex,right);
       }
    }