c的从大到小的排序算法

#include <stdio.h>
#define SIZE 10
int main()
{
int arr[SIZE]={100,200,400,21,-1,20,40,78,66,11};
int len=sizeof(arr)/sizeof(int);
int current_max=0;
int *p=arr;
for(int k=0;k<len;k++){
int count=0;
for(int i=0;i<len;i++)
{
count+=1;
//printf("%d=>%d=>%d\n",i,arr[i],p[i]);
int j=i+1;

if(j<len && p[i]<p[j])
{
int temp=p[i];
p[i]=p[j];
p[j]=temp;

}
}
printf("count=%d\n",count);
for(int i=0;i<len;i++){printf("%d ", arr[i]);}
printf("\n");
}
printf("%s","hello world!");
return 0;
}