implement the quick sort algorithm as a function (in C)

D QuickSort(A, n) if n > 1 then q -Partition(A, n) QuickSort(A[0...q -1],q) QuickSort (A[q + 1 . . . n-1], n-1-q) end if end QuickSort Partition(Am) Choose the partitioning value for j 0 to n-2 if A[5] then Swap these two end if end for Ali An -1] returni Swap these two 2 end Partition