quicksort_left_pivot

#include<stdio.h>

void print_array(int arr[], int array_length){

int i;

for(i=0; i<array_length; ++i) {
printf("%d ", arr[i]);
}

}

void swap(int *a, int *b){

int temp;

temp = *a;
*a = *b;
*b = temp;
}

void quicksort(int arr[], int l, int r){

if((r-l) >= 1){

int i, j, pivot = arr[l];
i = l+1;

for(j=l+1; j<r; ++j){
if(arr[j]<pivot){
swap(&arr[j], &arr[i]);
++i;
}
}

swap(&arr[l], &arr[i-1]);

quicksort(arr, l, i-1);
quicksort(arr, i, r);
}

}

void main(){

int arr[] = {2,1,3,7,5,4,6,15,50,45,60};
int arr_length = sizeof(arr)/sizeof(arr[0]);
int l = 0, r = arr_length;

printf("Unsorted array: ");
print_array(arr, arr_length);
printf("\n");

quicksort(arr, l, r);

printf("Sorted array: ");
print_array(arr, arr_length);
printf("\n");

}