从键盘上输入整数数组，并对数组中的元素进行排序 用c语言编程，大神们！！求助啊 C语言编程，从键盘输入10个数放到一维数组中，排序
c\u8bed\u8a00\u4ece\u952e\u76d8\u4e0a\u8f93\u5165N\u4e2a\u6574\u6570\u4fdd\u5b58\u5728\u6570\u7ec4\u4e2d,\u7528\u9009\u62e9\u6cd5\u6392\u5e8f\u5c06\u5176\u6309\u5347\u5e8f\u6392\u5217\u5e76\u5c06\u7ed3\u679c\u663e\u793a#include
#include
#define N 10
void main()
{
int i,j,temp;
int *a=(int *)malloc(sizeof(int)*N);//\u56e0\u4e3a\u4f60\u7684N\u6211\u4e0d\u77e5\u9053\u597d\u5927\uff0c\u6240\u4ee5\u5c31\u662f\u8fd9\u6837\u5b9a\u4e49\u6570\u7ec4\u3002
for(i=0;i<N;i++)
{
scanf("%d",&a[i]);
}
for(i=0; i<N-1; i++)
{
for(j=i+1; j<N; j++)
{
if(a[i]>a[j])
{
temp=a[i];
a[i]=a[j];
a[j]=temp;
}
}
}
for(i=0; i<N; i++) //\u8f93\u51fa\u5df2\u6392\u597d\u5e8f\u7684\u6570\u7ec4\u5143\u7d20\uff0c\u57df\u5bbd\u4e3a\u5de6\u5bf9\u9f503\u4f4d
printf("%-3d",a[i]);
printf("\n");
}
\u7ed9\uff0c\u5df2\u7ecf\u7f16\u8bd1\u8fd0\u884c\u786e\u8ba4\uff1a
#include
#include
int main()
{
int a[11]={0};
int num;
int i,j,t;
printf("\u8bf7\u8f93\u516510\u4e2a\u6570: \n");
for(i=0;i<10;i++)
{
fflush(stdin);
scanf("%d",&a[i]);
}
for(i=0;i<10;i++)
for(j=0;j<10;j++)
if(a[i]<a[j])
{
t=a[i];
a[i]=a[j];
a[j]=t;
}
printf("\u6392\u5e8f\u540e\u7684\u6570\u7ec4\u4e3a: \n");
for(i=0;i<10;i++) printf("%d ",a[i]);
printf("\n\u8bf7\u8f93\u5165\u8981\u63d2\u5165\u7684\u6570: \n");
scanf("%d",&num);
for(i=0;i<10;i++)
{
if(a[i]>num)
{
for(j=10;j>i;j--)
a[j]=a[j-1];
a[i]=num;
break;
}
}
printf("\u63d2\u5165\u540e\u7684\u6570\u7ec4\u4e3a: \n");
for(i=0;i<11;i++)
printf("%d ",a[i]);
getch();
return 1;
}
#include "stdio.h"
#define N 10
int main(int argv,char *argc[]){
int a[N],i,j,k;
printf("Please enter the %d integers...
",N);
for(i=0;i<N;scanf("%d",a+i++));
printf("Sorted:
");
for(i=0;i<N;i++){
for(k=i,j=k+1;j<N;j++)
if(a[k]<a[j])
k=j;
if(k-i)
j=a[k],a[k]=a[i],a[i]=j;
printf("%6d",a[i]);
}
printf("
");
return 0;
}
#include<stdio.h>
#define N 10
main(){
int a[N];
int i,j,k,t;
for(i=0; i<N; i++){
printf("a[%d]=?");
scanf("%d",&a[i]);
}
for(i=0; i<N-1; i++){
k=i;
for(j=i+1; j<N; j++)
if(a[j]<a[k]) k=j;
t=a[i];
a[i]=a[k];
a[k]=t;
}
for(i=0; i<N; i++){
printf("%d ",a[i]);
if((i+1)%5==0) //每行输出5个元素
printf("\n");
}
printf("\n");
}
#include<stdio.h>
int main()
{
int i,j,temp,a[10]={0};
for(i=0;i<10;i++)
scanf("%d",&a[i]);
for(i=0;i<10;i++)
for(j=i+1;j<10;j++)
if(a[i]>a[j])
{
temp=a[i];
a[i]=a[j];
a[j]=temp;
}
for(i=0;i<10;i++)
printf("%3d",a[i]);
printf("\n");
return 0;
}
绛旓細String o = "";for (int i = 0; i < a.length; i++) { System.out.print("璇杈撳叆绗"+(i+1)+"浣鏁存暟:");a[i] = sc.nextInt();//鍙兘褰曞叆鏁存暟 if (a[i]%2==0) { o+=","+a[i];} } System.out.println("鍋舵暟涓猴細"+o.substring(1));System.out.println("褰曞叆鏁...
绛旓細include<stdio.h> void main(){ int arr[10];int i,max,min,sum = 0;float ave;printf("璇杈撳叆鍗佷釜鏁:\n");for(i = 0; i < 10; i++){ scanf("%d",arr+i);if(i == 0)max = min = arr[i]; /*杈撳叆绗竴涓暟鏃舵妸杩欎釜鏁拌祴鍊肩粰鏈澶у煎拰鏈灏忓*/ else /*鍚﹀垯姣旇緝褰撳墠鏁...
绛旓細include<stdio.h> void main(){ int i,j,temp=0,num[100];for(i=0;i<100;i++){ if(num[i]==0){ break;} printf("璇杈撳叆绗%d涓鏁存暟(杈撳叆0缁撴潫杈撳叆)锛",(i+1)):scanf("%d",&[i]);} for(i=0;i<100;i++){ for(j=0;jnum[j+1]){ temp=num[j];num[j]=num[j+...
绛旓細include "stdio.h"int main(void){ int a[10],i,j,k; printf("Input 10 integers...\n"); for(i=0;i<10;scanf("%d",a+i),printf("%d ",a[i++])); printf("\n"); for(j=9,i=0;i<j;i++,j--) k=a[i],a[i]=a[j],a[j]=k; for(i=0...
绛旓細涓嬮潰鏄疌璇█浠ｇ爜瀹炵幇浠庨敭鐩樿緭鍏5涓鏁存暟骞淇濆瓨鍒鏁扮粍涓锛屾眰璇5涓暣鏁扮殑鏈澶у笺佹渶灏忓煎拰骞冲潎鍊硷細```c include <stdio.h> int main(){ int nums[5];int i, sum = 0, max, min;// 杈撳叆5涓暣鏁 printf("璇疯緭鍏5涓暣鏁帮細\n");for (i = 0; i < 5; i++) { scanf("%d", &nums...
绛旓細import java.util.Scanner;public class ArrayModifier { public static void main(String[] args) { // 寤虹珛涓涓10浣嶇殑鏁扮粍 int[] original = new int[10];// 璇诲彇浠庨敭鐩樿緭鍏鐨勫 Scanner sc = new Scanner(System.in);// 鎶婅鍒扮殑鏁存暟缁欐暟缁 for (int i = 0; i < 10; i++) { o...
绛旓細{ printf("娌℃湁鍚屾椂琚3鍜7鏁撮櫎鐨勬暟銆俓n");} return 0;} 绋嬪簭涓畾涔変簡涓涓暱搴︿负20鐨鏁村瀷鏁扮粍num锛屼娇鐢╢or寰幆浠庨敭鐩樿緭鍏20涓暣鏁帮紝骞跺垽鏂瘡涓暟鏄惁鑳藉悓鏃惰3鍜7鏁撮櫎锛屽鏋滄槸鍒欒緭鍑鸿鏁板苟灏嗚鏁板櫒count鍔1銆傛渶鍚庡垽鏂璫ount鐨勫硷紝濡傛灉涓0鍒欒緭鍑虹浉搴旂殑鎻愮ず淇℃伅銆傚笇鏈涗互涓婂洖绛斿彲浠ュ鎮ㄦ湁鎵甯姪銆
绛旓細include<stdio.h>void main() { int i,j,array[4][4],max,min,s0,s1; for ( i=0;i<4;i++ ) for ( j=0;j<4;j++ ) scanf("%d",&array[i][j]); max=min=array[0][0]; s0=s1=0; for ( i=0;i<4;i++ ) { for ( j=0;j<4;j++ ) { if ( max...
绛旓細瑙ｉ鎬濊矾锛氬厛閿洏杈撳叆10涓鏁存暟锛屽亣璁鏁扮粍鐨勭1涓槸鏈澶ф暟max锛屽悓鏃惰缃渶澶у间笅鏍囦负0锛屾帴鐫for寰幆渚濇鍒ゆ柇鍏舵槸鍚﹀ぇ浜庢渶澶ф暟锛屽鏋滃ぇ浜庢浛鎹㈡帀鏈澶у硷紝骞舵洿鏂版渶澶у间笅鏍囷紝鏈鍚庤緭鍑烘渶澶ф暟鍜屾暟缁勪笅鏍囥傚弬鑰冧唬鐮侊細include<stdio.h> int main() { int i,a[10],max,maxi;//杈撳叆10涓暣鏁 for(i=0;...
绛旓細鎸夌収浣犵殑瑕佹眰渚濇杈撳叆10涓鏁存暟,姣忚緭鍏ヤ竴涓暣鏁板氨杩涜鎺掑簭鐨凧ava绋嬪簭濡備笅 import java.util.Scanner;public class J { public static void bubblesort(int[] arr,int n){ for(int i=0;i<n-1;i++){ for(int j=0;j<n-1-i;j++){ if(arr[j]>arr[j+1]){ int temp=arr[j];arr[...
