Pastebin

Store your temporary text ASAP

Text

Created at: May 3, 2025 at 04:07:31 AM

#include <iostream>
using namespace std;

void quicksort(int x[], int f, int l) {
    if (f < l) {
        int i = f + 1;
        int j = l;

        while (x[i] < x[f]) i++;
        while (x[j] > x[f]) j--;

        while (i < j) {
            swap(x[i], x[j]);
            while (x[i] < x[f]) i++;
            while (x[j] > x[f]) j--;
        }

        swap(x[j], x[f]);

        quicksort(x, f, j - 1);
        quicksort(x, j + 1, l);
    }
}

int main() {
    int arr[] = {24, 13, 31, 25, 7, 2};
    int n = sizeof(arr) / sizeof(arr[0]);

    quicksort(arr, 0, n - 1);

    for (int i = 0; i < n; i++) {
        cout << arr[i] << " ";   
    }

    return 0;
}

New Paste

RecentTexts

#include <iostream>
May 3, 2025 at 04:07:31 AM
Marks Distribution L
March 1, 2025 at 04:46:09 AM
https://we.tl/t-pCLf
February 25, 2025 at 11:47:48 AM
this is a test paste
January 5, 2025 at 04:45:26 PM