一个简单的选择排序

一个简单的选择排序

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

#define ERR(x,y,z) if(x)  \
					{ \
						printf(y);\
						return z;\
					} 
#define SIZE 8

void select_sort(int *buf, int size);
void show_buf(int *buf, int size);

int main(int argc,char *argv[])
{
	int buf[SIZE] = {1,3,9,46,45,67,1,9};
	
	select_sort(buf,SIZE);
	show_buf(buf,SIZE);

	return 0;
}


void select_sort(int *buf, int size)
{
	ERR(NULL == buf,"buf false\n",);

	int i,j;
	int min;
	int temp = 0;

	for(i = 0; i < size - 1; i++)
	{
		min = i;

		for(j = i + 1; j < size; j++)
		{
			if(*(buf + j) < *(buf + min))
				min = j;	
		}

		if(i != min)
		{
			temp = *(buf + min);
			*(buf + min) = *(buf + i);
			*(buf + i) = temp;
		}
	}
}


void show_buf(int *buf,int size)
{
	ERR(NULL == buf,"buf false\n",);
	
	int i = 0;

	for(i = 0; i < size; i++)
		printf("%d\t",*(buf + i));
	printf("\n");	
}