Quick sort(Implementation in C)

quicksort.c

#include <stdio.h>

void quicksort(int arr[], int start, int stop){
    if(start < stop){
        int left = start;
        int right = stop;
        int pivot = arr[start];

        while(arr[left] < pivot){
            left += 1;
        }

        while(arr[right] > pivot){
            right -= 1;
        }

        if(left <= right){
            int temp = arr[left];
            arr[left] = arr[right];
            arr[right] = temp;
            left += 1;
            right -= 1;
        }

        quicksort(arr, start, right);
        quicksort(arr, left, stop);
    }
}

int main(){
    int arr[] = {5, 2, 3, 4, 1};
    int n = sizeof(arr)/sizeof(arr[0]);
    quicksort(arr, 0, n-1);
    printf("After sorting\n");
    for(int i = 0; i < n; i++){
        printf("%d ", arr[i]);
    }
    printf("\n");
}