QuickSort 알고리즘 소스 코드

#include <iostream>
#include <algorithm>
using namespace std;

void partition(int arr[], int left, int right) {
    int pivot, temp;
    int low, high;
    low = left;
    high = right;
    pivot = arr[(left+right) / 2];
    
    while(low < high) {
        while(arr[low] < pivot)
            low++;
        while(arr[high] > pivot)
            high--;
        
        if(low <= high) {
            if(low != high) {
                swap(arr[low],arr[high]);
            }
            low++;
            high--;
        }
    }
    if(left < high) {
        partition(arr, left, high);
    }
    if(low < right) {
        partition(arr, low, right);
    }
    
}
int main() {
    int arr[] = {10,3,5,1,2};
    partition(arr,0,4);
    for(int i=0;i<5;i++)
        cout<<arr[i]<<' ';
}