用冒泡排序法(书上有代码),然后在看下如何定义数组就好了,自己写用不聊多久的
//---------------------------------------------------------------------------
#include
int main(void)
{
int i,a[10],*min;
for (min=&a[i = 0]; i < 10; i++) {
scanf("%d",&a[i]);
if (*min>a[i]) min=&a[i];
}
printf("Min:%d\n",*min);
return 0;
}
//---------------------------------------------------------------------------
int min(int a[ ],int n)
{
int i = 0;
int min = a[0];
int index =0;
for(i = 1;i
if(a[i]
min = a[i];
index = i;
}
}
return min;
}
void main()
{
int a[10];
int i;
int minv =0;
for(i =0;i<10;i++)
{
printf("please input a[%d]",i);
scanf("%d",a[i]);
}
minv = min(a,10);
printf("min is %d",minv);
}