编程题：1：定义含有10个元素的数组，并将数组中的元素按逆序从新存放后输出。 编程题：1：定义含有10个元素的数组，并将数组中的元素按逆序...
\u4e00\u3001\u5efa\u7acb\u4e00\u4e2a10\u4e2a\u5143\u7d20\u7684int\u6570\u7ec4\uff0c 1) \u968f\u673a\u8d4b\u503c 100\u4ee5\u5185\u7684\u6574\u6570 2) \u6309\u964d\u5e8f\u6392\u5e8f 3) \u8f93\u51fa\u6392\u5e8f\u540e\u7684\u6570\u7ec4\u5143\u7d20#include
#include
#include
int main()
{
int a[10];
int i,j,t;
srand(time(NULL));
for(i = 0; i < 10; i ++)
a[i] = rand()%100;
for(i = 0; i < 9; i ++)
for(j = i+1; j < 10; j ++)
if(a[i]<a[j])
{
t = a[i];
a[i] = a[j];
a[j] = t;
}
for(i = 0; i < 10; i ++)
printf("%d ", a[i]);
}
#include
void main()
{
int i, j, a[10],temp;
for (i = 0; i < 10; i++)
scanf("%d",&a[i]);
printf("\n");
for (i = 0; i < 9; i++)
for (j = i+1; j < 10; j++)
if (a[j]<a[i])
{
temp = a[i];
a[i] = a[j];
a[j] = temp;
}
for (i = 0; i < 10; i++)
printf("%3d",a[i]);
}
void main()
{
int i, j, a[10],temp;
for (i = 0; i < 10; i++)
scanf("%d",&a[i]);
printf("\n");
for (i = 0,j=9; i< =9&&j>=0; i++,j--)//交换首尾的数,实现逆序存放
{
temp = a[i];
a[i] = a[j];
a[j] = temp;
}
for (i = 0; i < 10; i++)
printf("%3d",a[i]);
}
#include <stdio.h>
void main()
{
int i, j, a[10],temp;
for (i = 0; i < 10; i++)
scanf("%d",&a[i]);
printf("\n");
for (i = 0; i < 9; i++)
for (j = i+1; j < 10; j++)
if (a[j]<a[i])
{
temp = a[i];
a[i] = a[j];
a[j] = temp;
}
for (i = 0; i < 10; i++)
printf("%3d",a[i]);
}
绛旓細int arrary[10];int i;for(i=0;i!=10;i++){ printf("杈撳叆绗%d涓厓绱:",i+1);scanf("%d",&arrary[i]);printf("绗%d涓厓绱犵殑鍊兼槸:%d.\n\n",(i+1),arrary[i]);} int _max=max(arrary,10);int _min=min(arrary,10);float _avarge=avarge(arrary,10);printf("鏈澶ф暟鏄:...
绛旓細for(i=0;i<n;i++)scanf("%d",&a[i]);printf("\n杈撳叆鐨10涓鏁版槸锛歕n");printf("杈撳嚭浣犺緭鍏ョ殑鍏冪礌:\n");for(int i=0;i<10;i++){ printf("arr[%d]=%d\n",i,arr[i]);} printf("鏁扮粍鎬诲拰涓:%d\n",sum);} 涓庣粨鏋勬垨绫讳腑鐨勫瓧娈 鏁扮粍涓殑鎵鏈夊厓绱犻兘鍏锋湁鐩稿悓绫诲瀷锛堣繖涓鐐瑰拰...
绛旓細Private Sub Command1_Click()Dim a(10) As Integer For i = 1 To 10 a(i) = 2 * i Print a(i);Next i End Sub
绛旓細for (int i = 0; i < 10; i++){ n[i] = int.Parse(Console.ReadLine());} int max = n[0];int index = 0;for (int i = 0; i < 10; i++){ if (n[i] > max){ max = n[i];index = i;} } Console.WriteLine("10涓鏁颁腑鏈澶х殑鏄:{0},鏄暟缁勪腑绗瑊1}涓厓绱"...
绛旓細鐪嬫垜杩欎釜鏈绠鍗曠殑锛歩mport java.util.*;class Test{ public void main(String []args){ int []arr={10,8,7,3,1,4,5,8,4,6};//瀹氫箟鏁扮粍 Arrays.sort(arr);//璋冪敤arrays閲岀殑鎺掑簭绠楁硶 for(int i:arr){ System.out.println(arr[i]); //杈撳嚭 } } } 鍝堝搱锛屻傛槸涓嶆槸瓒呯煭鍟婏紒锛
绛旓細import java.util.Arrays;public class testArray {public static void main(String[] args) {int[] arr = new int[10];for (int i = 0; i < 10; i++) {arr[i] = i;}Arrays.sort(arr);for (int i = 9; i >= 0; i--) {System.out.print(arr[i] + "");}}} ...
绛旓細鏁扮粍瀹氫箟浜嗕箣鍚庡氨鏃犳硶鏀瑰彉鍏堕暱搴︼紝濡傛灉浣犺繕鎯崇户缁緭鍏ュ彧鏈夊缓绔涓涓暱搴︽洿澶х殑鏂版暟缁勶紝鐒跺悗灏嗗綋鍓嶆暟缁勬嫹璐濆埌鏂版暟缁勯噷闈紝鍐嶇户缁帴鏀朵綘杈撳叆鐨勭11涓厓绱 鎷疯礉鏁版嵁鏂规硶 System.arraycopy锛坒rom,fromindex,to,toindex,count锛夊弬鏁癴rom琛ㄧず浠庢煇涓暟缁勬嫹璐 fromindex琛ㄧず浠庢暟缁勭殑鍝釜浣嶇疆寮濮嬫嫹璐 to琛ㄧず灏嗗綋鍓嶆暟缁...
绛旓細include <stdio.h>int main(){ int a[10]; int i; int max; for(i = 0; i < 10; i ++) scanf("%d",&a[i]); max = a[0]; for(i = 1; i < 10; i ++) if(max < a[i]) max = a[i]; printf("鏈澶у=%d\n", max); return 0...
绛旓細include<stdio.h> define N 10 void main() { int a[N],i,max,min,a3,a5,a7; float av;for ( i=0;i<N;i++ ) scanf("%d",&a[i]);max=min=a[0]; for ( i=1;i<N;i++ ) if ( maxa[i] ) min=a[i];a3=a5=a7=0; av=0;for ( i=0;i<N;i++ ) { av+=a...
绛旓細涓涓骇鏈
