冒泡排序

#include"stdio.h"
#define TYPEDEF int
void main()
{
		int h,k,i;
		int temp,count;
		int S[]={23,435,45,678,879,43,67};
		count=sizeof(S)/sizeof(TYPEDEF);
		for(k=0;k<count;k++)
	{
		for(h=0;h<count-k-1;h++)
		{	
			
			if(S[h]<S[h+1])
			{
				temp=S[h+1];
				S[h+1]=S[h];
				S[h]=temp;
			}
		}
	}


		for(i=0;i<count;i++)
	{
		printf("%d ",S[i]);
	}
}