bsi.c

#include <stdio.h>
#include <string.h>

static inline int _ccv_nnc_try_sort_and_insert(int* md, const int ins, const int c)
{
	if (!c)
	{
		md[0] = ins;
		return 1;
	}
	int ll = 0, uu = c - 1;
	int mm;
	do {
		mm = ll + ((uu - ll) >> 1);
		if (ins == md[mm])
			return 0;
		else if (ins < md[mm])
			uu = mm - 1;
		else if (ins > md[mm])
			ll = mm + 1;
	} while (ll <= uu);
	if (ll < c)
		memmove(md + ll + 1, md + ll, sizeof(int) * (c - ll));
	md[ll] = ins;
	return 1;
}

void main()
{
	int md[1024];
	int c = 0;
	c += _ccv_nnc_try_sort_and_insert(md, 3, c);
	c += _ccv_nnc_try_sort_and_insert(md, 3, c);
	c += _ccv_nnc_try_sort_and_insert(md, 0, c);
	c += _ccv_nnc_try_sort_and_insert(md, 10, c);
	c += _ccv_nnc_try_sort_and_insert(md, 2, c);
	c += _ccv_nnc_try_sort_and_insert(md, 1, c);
	c += _ccv_nnc_try_sort_and_insert(md, 0, c);
	c += _ccv_nnc_try_sort_and_insert(md, 3, c);
	c += _ccv_nnc_try_sort_and_insert(md, 2, c);
	c += _ccv_nnc_try_sort_and_insert(md, 1028, c);
	c += _ccv_nnc_try_sort_and_insert(md, 1, c);
	c += _ccv_nnc_try_sort_and_insert(md, 0, c);
	c += _ccv_nnc_try_sort_and_insert(md, 3, c);
	c += _ccv_nnc_try_sort_and_insert(md, 8, c);
	c += _ccv_nnc_try_sort_and_insert(md, 8, c);
	c += _ccv_nnc_try_sort_and_insert(md, 7, c);
	c += _ccv_nnc_try_sort_and_insert(md, 1, c);
	printf("c: %d\n", c);
	int i;
	for (i = 0; i < c; i++)
		printf("%d\n", md[i]);
}