The following code is a C implementation of a sorting algorithm:

void FSort(int* a, int left, int right)
{
    if (left < right) {
        static int c = 0;
        int i = left, j = right + 1;
        int d = a[left];
        do {
            do i++; while (a[i] < d);
            do j--; while (a[j] > d);
            if (i < j) {
                int z = a[i]; a[i] = a[j]; a[j] = z;
            }
        } while (i < j);
        int z = a[left]; a[left] = a[j]; a[j] = z;
        printf("c=%d\n", ++c);
        FSort(a, left, j - 1);
        FSort(a, j + 1, right);
    }
}

Assume that we want to use this function to sort a 10-element array m, given by

int m[] = { 3,5,9,8,2,0,4,1,6,7 };