版权声明：本文为博主原创文章，未经博主允许不得转载。 https://blog.csdn.net/wwwww_bw/article/details/53846946
#include <stdio.h>
int main()
{
int a,b,c,n;
printf("please input n:\n");
scanf("%d",&n);
{
int a,b,c,n;
printf("please input n:\n");
scanf("%d",&n);
if(n <= 0)
{
printf("input n error\n");
return -1;
}
{
printf("input n error\n");
return -1;
}
int src[n];
int str[n];
int count = 0;
int count1 = 0;
int str[n];
int count = 0;
int count1 = 0;
printf("please input number\n");
for(a = 0;a < n;a++)
{
scanf("%d",&src[a]);
}
int *p;
p = src;
for(a = 0;a < n;a++)
{
scanf("%d",&src[a]);
}
int *p;
p = src;
c = n;
while(c--)
{
for(b = 0;b < n;b++) //思路：*p是首元素， 算出数组中有几个元素比他大的，有几个和他相等的，然后放到另一个数组中，然后p++，直到遍历完数组
{
if(*p > src[b])
count++;
if(*p == src[b])
count1++;
}
// printf("count = %d\n",count);
{
for(b = 0;b < n;b++) //思路：*p是首元素， 算出数组中有几个元素比他大的，有几个和他相等的，然后放到另一个数组中，然后p++，直到遍历完数组
{
if(*p > src[b])
count++;
if(*p == src[b])
count1++;
}
// printf("count = %d\n",count);
while(count1--)
{
// str[n - count -count1 - 1] = *p; 逆序输出
str[count + count1] = *p; //正序输出
}
count = 0;
count1 = 0;
p = p + 1;
{
// str[n - count -count1 - 1] = *p; 逆序输出
str[count + count1] = *p; //正序输出
}
count = 0;
count1 = 0;
p = p + 1;
}
for(a = 0;a < n;a++)
{
printf("str[%d] = %d\n",a,str[a]);
}
for(a = 0;a < n;a++)
{
printf("str[%d] = %d\n",a,str[a]);
}
return 0;
}
}