- 论坛徽章:
- 0
|
1.打印下面的图形
*
*.*.
*..*..*..
*...*...*...*...
*....*....*....*....*....
*.....*.....*.....*.....*.....*.....
*......*......*......*......*......*......*......
*.......*.......*.......*.......*.......*.......*.......*.......
#include
main()
{
int i,k,j;
for (i=1;i
2.完成程序,实现对数组的降序排序
#include
void sort( );
int main()
{
int array[]={45,56,76,234,1,34,23,2,3}; //数字任//意给出
sort( );
return 0;
}
void sort( )
{
____________________________________
| |
| |
|-----------------------------------------------------|
}
http://blog.csdn.net/popkiler/archive/2007/09/11/1780229.aspx
程序如下:
#include
void sort(int *,int);
int main()
{
int j;
int array[]={10,12,1,5,48,458,3,41,25,18};
int n=sizeof(array)/sizeof(int);
sort(array,n);
for(j=0;j
void sort(int *q,int N)
{
int j,p,temp;
for(p=1;p0 && q[j-1]>temp;j--)
q[j]=q[j-1];
q[j]=temp;
}
}
本文来自ChinaUnix博客,如果查看原文请点:http://blog.chinaunix.net/u2/69832/showart_1931501.html |
|