Sort binary array in linear time

#include <stdio.h>
 
// Utility function to swap elements `A[i]` and `A[j]` in an array
void swap(int A[], int i, int j)
{
    int temp = A[i];
    A[i] = A[j];
    A[j] = temp;
}
 
// Function to sort a binary array in linear time
int partition(int A[], int n)
{
    int pivot = 1;
    int j = 0;
 
    // each time we encounter a 0, `j` is incremented, and
    // 0 is placed before the pivot
    for (int i = 0; i < n; i++)
    {
        if (A[i] < pivot)
        {
            swap(A, i, j);
            j++;
        }
    }
}
 
int main(void)
{
    int A[] = { 1, 0, 0, 0, 1, 0, 1, 1 };
    int n = sizeof(A)/sizeof(A[0]);
 
    partition(A, n);
 
    // print the rearranged array
    for (int i = 0; i < n; i++) {
        printf("%d ", A[i]);
    }
 
    return 0;
}