1.完成下列程序
*
*.*. *..*..*.. *...*...*...*... *....*....*....*....*....
*.....*.....*.....*.....*.....*..... *......*......*......*......*......*......*......
*.......*.......*.......*.......*.......*.......*.......*.......
#include<stdio.h>
#define N 8
int main()
{
int i,j,k;
for(i=0;i<N;i++)
{
for(j=0;j<=i;j++)
{
printf("*");
for(k=0;k<i;k++)
{
printf(".");
}
}
printf("/n");
}
return 0;
}
2.完成程序,实现对数组的降序排序
#include<stdio.h>
void sort(int array[],int n)
{
int i,j,temp;
for(i=0;i<n;i++)
{
for(j=i;j<n;j++)
{
if(array[i]<array[j])
{
temp=array[i];
array[i]=array[j];
array[j]=temp;
}
}
}
}
int main()
{
int i, n;
int array[]={51,75,24,5,76,7453,451,6,455};
n=sizeof(array)/sizeof(int);
sort(array,n);
for(i=0;i<n;i++)
{
printf("%d",array[i]);
printf(",");
}
return 0;
}
3.