快速排序的代码

最新推荐文章于 2023-12-30 16:38:57 发布

bandaotilan

最新推荐文章于 2023-12-30 16:38:57 发布

阅读量193

点赞数

分类专栏：排序算法

本文链接：https://blog.csdn.net/bandaotilan/article/details/8548969

版权

排序算法专栏收录该内容

2 篇文章 0 订阅

订阅专栏

#include<iostream>

using namespace std;

void quickSort(int s[], int l, int r){
   int i = l;
   int j = r;
   int x = s[i];
   if(l < r){
       while(i < j){
           while(i < j && s[j] >= x)
               j--;
           if(i < j){
               s[i] = s[j];
               i++;
           }

           while( i < j && s[i] < x)
               i++;
           if(i < j){
               s[j] = s[i];
               j--;
           }
       }
       s[i] = x;
       quickSort(s, l, i -1);
       quickSort(s , i + 1, r);
   }
}

int main(){
   int s [] = {50 , 44, 80 , 22 , 33 , 61, 55 , 35 , 78 ,100 };
   int l = 0;
   int r = 9;
   cout<<"first:"<<endl;
   for(int i = 0; i < 10; i += 5){
       cout<<s[i]<<" "<<s[i+1]<<" "<<s[i+2]<<" "<<s[i+3]<<" "<<s[i+4]<<" "<<endl;
   }
   quickSort(s, l, r);
   cout<<"after sort:"<<endl;
   for(int i = 0; i < 10; i += 5){
       cout<<s[i]<<" "<<s[i+1]<<" "<<s[i+2]<<" "<<s[i+3]<<" "<<s[i+4]<<" "<<endl;
   }
}