A simple clean code for partitioning an array

partition.cpp

/* Partition an array with 0s and 1s */
void partition(int* v, int n) {
	int i=0, k=n;
	while(i<k) {
		if(v[i] == 0) i++;
		else swap(v[i], v[--k]);
	}
}

/* Partition step in Quicksort algorithm */
void partitionPivot (int* v, int n) {
  	// Taking the pivot as the 0th element
	int pivot = v[0];
	int i=1, k=n;
	while(i<k) {
		if(v[i] <= pivot) i++;
		else swap(v[i], v[--k]);
	}
	if(k-1 > 0) swap(v[0], v[k-1]);
}