快排

#include <stdio.h>
int arr[]= {3,8,11,92,34,12,7};

int partition(int l , int r )
{
    int x = arr[r];
    int temp;
    int i = l -1 ;
    for ( int j = l ; j < r  ; j++)
        if ( arr[j] < x)
        {
           i++;
            temp = arr[j];
           arr[j] = arr[i];
           arr[i] = temp;     
        }
    temp = arr[r];
    arr[r] = arr[i +1];
    arr[i+1] = temp;
    return i +1;
}
void quicksort( int l , int r)
{
    if ( l < r)
    {
     int q = partition( l , r);
     quicksort( l , q -1);
     quicksort( q+1 , r);
    }     
}
int main()
{
 quicksort(0,6);
 for (int i =0 ;i <7 ; i++)
     printf("%d" , arr[i]);
 scanf("%d" , &arr[0]);
 return 0;    
}