Computer Engineering

#include <iostream>
using namespace std;

void partition(int S[], int low, int high, int &pivotpoint) {
    int pivot = S[low]; 
    int j = low;
    int temp;

    for (int i = low + 1; i <= high; i++) {
        if (S[i] < pivot) {
            j++;
            temp = S[i];
            S[i] = S[j];
            S[j] = temp;
        }
    }

    temp = S[low];
    S[low] = S[j]; 
    S[j] = temp;
    pivotpoint = j;
}

void quickSort(int S[], int low, int high) {
    if (low < high) {
        int pivotpoint;
        partition(S, low, high, pivotpoint);
        quickSort(S, low, pivotpoint - 1);
        quickSort(S, pivotpoint + 1, high);
    }
}

int main() {
    int S[9] = {45, 62, 17, 1, 54, 30, 21, 95, 83};

    quickSort(S, 0, 8);

    for (int i = 0; i < 9; i++)
        cout << S[i] << "\t"; 
        
    return 0;
}