快速排序(C++）

芒果冰冰包

于 2024-10-21 23:35:01 发布

阅读量147

点赞数 1

CC 4.0 BY-SA版权

文章标签：算法 c++ 数据结构

本文链接：https://blog.csdn.net/qq_41932686/article/details/143136181

#include<iostream>  
using namespace std;

int partition(int a[], int low, int high)
{
    int pivot = a[low];
    while (low < high)
    {
        while (low < high && a[high] >= pivot) high--;
        a[low] = a[high]; 
        low++;  

        while (low < high && a[low] <= pivot) low++;
        a[high] = a[low];   
        high--;   
    }  
    a[low] = pivot;
    return low;
}

void quicksort(int a[], int low, int high)
{ 
    if (low < high)
    {
        int pivotpos = partition(a, low, high);
        quicksort(a, low, pivotpos - 1);
        quicksort(a, pivotpos + 1, high);
    }
}

int main()
{
    int array[10] = { 3, 6, 2, 4, 9, 34, 13, -6, 44 ,33};
    quicksort(array, 0, 9);
    for (int i = 0; i < 10; i++)
    {
        cout << array[i] << "\t";
    }
    return 0;
}