Can someone translate the function median_of_medians into a C programming code?

median_partition is almost the same as the partition algorithm used in Basic Quicksort, except that it chooses a good partitioning element using a median-of-medians method: median_partition (A, P. r) median - median_of_medians (A, D, I) find index ind of median swap Aind] with A[r] x - A[r] i - p - 1 for j = p to r - 1 if A[j]