ランキング関数 使用例

/*		test3.c		*/
#include <stdio.h>
#include <stdlib.h>
#include "sort.h"

static long _idum_o1 = 987612345L;

double ornd1(void);
int irnd(int max, int min);
int *mkdata_i(int n, int min, int max);
double *mkdata_d(int n, double min, double max);
uchar **mkdata_s(int n, int smin, int smax, uchar min, uchar max);
uchar **mkdata_sd(int n, int smin, int smax, uchar min, uchar max);
void shuffle_c(uchar **a, int n);

int main(void)
{
	int i, n;
	int *data_i;
	double *data_d;
	uchar **data_s;

	n = 100;

	data_i = mkdata_i(n, 0, 299);
	printf("rank_i : result=%d\n", rank_i(data_i, n, 50));
	qsort_i(data_i, n);
	for(i = 0; i < n; i++)
	{
		printf("%2d:%3d  ", i, *(data_i + i));
		if(i % 10 == 9)	putchar('\n');
	}
	putchar('\n');

	data_d = mkdata_d(n, 0.,299.);
	printf("rank_d : result=%3.0f\n", rank_d(data_d, n, 50));
	qsort_d(data_d, n);
	for(i = 0; i < n; i++)
	{
		printf("%2d:%3.0f  ", i, *(data_d + i));
		if(i % 10 == 9)	putchar('\n');
	}
	putchar('\n');

	data_s = mkdata_sd(n, 3, 3, 'a', 'z');
	printf("rank_c : result=%s\n", rank_c(data_s, n, 50));
	qsort_c(data_s, n);
	for(i = 0; i < n; i++)
	{
		printf("%2d:%3s  ", i, *(data_s + i));
		if(i % 10 == 9)	putchar('\n');
	}
	putchar('\n');
	return 1;
}

int *mkdata_i(int n, int min, int max)
{
	int i, *data, *p;

	if(n < 1 || max < min)
	{
		fprintf(stderr, "Error : illegal input  in mkdata_i()\n");
		fprintf(stderr, "    n=%d, min=%d, max=%d\n", n, min, max);
		return NULL;
	}
	data = (int *)malloc(n * sizeof(int));
	if(data == NULL)
	{
		fprintf(stderr, "Error : out of memory  in mkdata_i()\n");
		return NULL;
	}
	for(i = 0, p = data; i < n; i++)	*p++ = irnd(max, min);
	return data;
}

double *mkdata_d(int n, double min, double max)
{
	int i;
	double *data, *p;

	if(n < 1 || max < min)
	{
		fprintf(stderr, "Error : illegal input  in mkdata_d()\n");
		fprintf(stderr, "    n=%d, min=%e, max=%e\n", n, min, max);
		return NULL;
	}
	data = (double *)malloc(n * sizeof(double));
	if(data == NULL)
	{
		fprintf(stderr, "Error : out of memory  in mkdata_d()\n");
		return NULL;
	}
	for(i = 0, p = data; i < n; i++)	*p++ = min + (max - min) * ornd1();
	return data;
}

uchar **mkdata_s(int n, int smin, int smax, uchar min, uchar max)
{
	int i, *len, *lp;
	uchar **data, **p, *pp;

	if(n < 1 || max < min || smax < smin || smin < 1)
	{
		fprintf(stderr, "Error : illegal input  in mkdata_s()\n");
		fprintf(stderr, "    n=%d, smin=%d, smax=%d, min=%u, max=%u\n",
			n, smin, smax, min, max);
		return NULL;
	}
	data = (uchar **)malloc(n * sizeof(uchar *));
	len = mkdata_i(n, smin, smax); 
	if(data == NULL || len == NULL)
	{
		fprintf(stderr, "Error : out of memory  in mkdata_s()\n");
		return NULL;
	}
	for(i = 0, p = data, lp = len; i < n; i++, lp++)
	{
		pp = *p++ = (uchar *)malloc((smax + 1) * sizeof(uchar *));
		while((*lp)--)	*pp++ = irnd(max, min);
		*pp = '\0';
	}
	free((uchar *)len);
	return data;
}

double ornd1(void)					/* Park and Miller の「最低基準」乱数 */
{
	long w;
	double d = 1. / 2147483647.;

	w = _idum_o1 / 44488L;
	if((_idum_o1 = (_idum_o1 - w * 44488L) * 48271L - w * 3399) <= 0)
		_idum_o1 += 2147483647L;
	return (double)_idum_o1 * d;
}

int irnd(int max, int min)
{
	return min + (int)(ornd1() * (double)(max - min + 1));
}

uchar **mkdata_sd(int n, int smin, int smax, uchar min, uchar max)
{
	uchar **data, **dp, *dpp; 
	int i, len, nn;

	data = mkdata_s(n, smin, smax, min, max);
	while(1)
	{
		qsort_c(data, n);
		if((nn = n - dbldel_c(data, n, 1)) == 0)	break;
		dp = data;
		while(nn--) 
		{
			while(**dp)	dp++;
			len = irnd(smax, smin);
			dpp = *dp;
			while(len--)	*dpp++ = irnd(max, min);
			*dpp = '\0';
		} 
	}
	shuffle_c(data, n);
	return data;
}

void shuffle_c(uchar **a, int n)
{
	int i, m;
	uchar **p, **q, *w;

	for(i = 0, m = n * 5; i < m; i++)
	{
		p = a + (int)(ornd1() * n);
		q = a + (int)(ornd1() * n);
		w = *p;
		*p = *q;
		*q = w;
	}
}