simple quick sort

gistfile1.txt

#include <iostream>

void swap(int* a, int* b) {
    int t = *a;
    *a = *b;
    *b = t;
}

int partition(int arr[], int low, int high ) {
    int pivot = arr[high];
    int i = (low - 1);
    for (int j = low;  j <= high -1; j++) {
        if (arr[j] <= pivot) {
            i++;
            swap(&arr[i], &arr[j]);
        }
    }
    
    swap(&arr[i+1], &arr[high]);
    return i+1;
}


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

void printArray(int arr [], int size) {
    for (int i = 0; i < size; i++) {
        printf("%d ", arr[i]);
    }
    printf("\n");
}

int main(int argc, const char * argv[]) {
    printf("start\n");
    int sz = 100000000;
    int* arr = new int[sz];
    for (int i = 0; i < sz; i++) {
        arr[i] = rand()%100;
    }
    printf("sorting\n");
    
    quicksort(arr, 0, sz-1);
        
    printf("Sorted:\n");
    printArray(arr, sz);
    
    delete [] arr;
    return 0;
}