算法导论C语言实现: 计数排序

#include <common.h>

//COUNTING-SORT
//k: 0-k
void COUNTING_SORT(
	__in sortdata_i_t *A,
	__out sortdata_i_t *B,
	__in int k)
{
	int *C = (int *)malloc(sizeof(int)*(k + 1));
	int i = 0;
	int j = 0;

	for (i = 0; i <= k; ++i) {
		C[i] = 0;
	}

	for (j = 0; j < A->length; ++j) {
		C[A->data[j]]++;
	}

	for (i = 1; i <= k; ++i) {
		C[i] += C[i-1];
	}

	for ( j = (A->length - 1); j >= 0; --j) {
		B->data[C[A->data[j]] - 1] = A->data[j];
		C[A->data[j]]--;
	}

	free(C);
}

#define ARRAY_SIZE 16
#define MAX_VALUE  8

void main()
{
	sortdata_i_t A, B;
	int i = 0;

	A.data = (int *)malloc(ARRAY_SIZE * sizeof(int));
	A.length = ARRAY_SIZE;
	B.data = (int *)malloc(ARRAY_SIZE * sizeof(int));
	B.length = ARRAY_SIZE;

	if (A.data == NULL || B.data == NULL) {
		TRACE("Out of memory!\n");
		if (A.data != NULL) {
			free(A.data);
		}
		if (B.data != NULL) {
			free(B.data);
		}
		return;
	}

	memset(A.data, 0, sizeof(int) * A.length);
	memset(B.data, 0, sizeof(int) * B.length);

	for (i = 0; i < A.length; ++i) {
		A.data[i] = rand()%(MAX_VALUE + 1);
	}

	COUNTING_SORT(&A, &B, MAX_VALUE);

	free(A.data);
	free(B.data);

	system("pause");
}