quick_sort

#include <stdio.h>

void quicksort(int arr[], int low, int high){
    if(low>=high)
        return;
    int i;
    printf("\n");
    for(i=0;i<10;i++)
        printf("%d\t",arr[i]);
    int part = partition(arr,low,high);
    quicksort(arr,low,part-1);
    quicksort(arr,part+1,high);
}

int partition(int arr[], int l, int h){
    int pi = h;
    int i=pi, j, tmp;

    for(j=i-1;j>=l;j--){
        if(arr[j]>arr[pi]){
            --i;
            tmp = arr[j];
            arr[j] = arr[i];
            arr[i] = tmp;
            }
        }
        tmp = arr[i];
        arr[i] = arr[pi];
        arr[pi] = tmp;

        return i;
    }


int main(){

    int arr[10] ={70,90,40,30,15,25,20,10,67,5};
    quicksort(arr,0,9);
    int i;
    printf("\n");
    for(i=0;i<10;i++)
        printf("%d\t",arr[i]);
    return 1;
}