用C语言编写一个将数组由小到大顺序排列，范围为5到10，数组由键盘输入，显示排列后的数组，跪求高手！ c语言问题，把一维数组的N(N=10)个元素按由小到大的顺序...
\u7f16\u5199C\u8bed\u8a00\u7a0b\u5e8f\uff0c\u628a\u4e00\u4e2a\u6570\u7ec4\u6309\u4ece\u5c0f\u5230\u5927\u7684\u6b21\u5e8f\u6392\u5217\u8d77\u6765\u6e90\u7a0b\u5e8f\u4ee5\u53ca\u7b97\u6cd5\u6ce8\u91ca\u5982\u4e0b\uff1a
#define _CRT_SECURE_NO_WARNINGS//VS\u7f16\u8bd1\u73af\u5883\u9700\u8981\u8fdb\u884c\u5b8f\u5b9a\u4e49\uff0cVC6.0\u53ef\u5ffd\u7565
#include//\u8f93\u5165\u8f93\u51fa\u5934\u6587\u4ef6
int main()
{
int number[10], New_number[10];//\u5b9a\u4e49\u6570\u7ec4\u7684\u6570\u636e\u7c7b\u578b\u4e3a\u6574\u578b
int i, j, m, n, k;//\u5b9a\u4e49\u53d8\u91cf\u7684\u6570\u636e\u7c7b\u578b\u4e3a\u6574\u578b
printf("input 10 number\uff1a");//\u6587\u5b57\u63d0\u793a
for (i = 0; i <= 9; i++)//\u7528\u5faa\u73af\u8f93\u5165\u6570\u503c\u7ed9\u6570\u7ec4number\u5e76\u8d4b\u7ed9\u6570\u7ec4New_number
{
scanf("%d", &number[i]);//\u8f93\u516510\u4e2a\u6574\u5f62\u6570\u5b57\u5230\u6570\u7ec4\u4e2d
New_number[i] = number[i];//\u6570\u7ec4number\u5143\u7d20\u8d4b\u7ed9\u6570\u7ec4New_number
}
for (n = 0; n <= 8; n++)//\u8981\u8fdb\u884c(10-1)\u7ec4\u6bd4\u8f83
for (j = 0; j <= 8 - n; j++)//\u6bcf\u7ec4\u8fdb\u884c(10\u51cf\u7b2c\u51e0\u7ec4)\u6b21\u6bd4\u8f83
{
if (number[j] > number[j + 1])//\u6bd4\u8f83\u5927\u5c0f\u5e76\u5c06\u5c0f\u7684\u8d4b\u7ed9\u524d\u9762\u7684\u6570\u7ec4
{
k = number[j];//\u5c06\u76f8\u5bf9\u8f83\u5927\u7684\u5143\u7d20\u8d4b\u503c\u7ed9\u4e2d\u95f4\u5143\u7d20
number[j] = number[j + 1];//\u5c06\u76f8\u5bf9\u8f83\u5c0f\u7684\u5143\u7d20\u9001\u8fbe\u524d\u9762\u4e00\u4e2a\u4f4d\u7f6e
number[j + 1] = k;//\u5c06\u4e2d\u95f4\u53d8\u91cf\u5143\u7d20\u9001\u7ed9\u540e\u9762\u4e00\u4e2a\u4f4d\u7f6e
}
if (New_number[j] < New_number[j + 1])//\u6bd4\u8f83\u5927\u5c0f\u5e76\u5c06\u5927\u7684\u8d4b\u7ed9\u524d\u9762\u7684\u6570\u7ec4
{
k = New_number[j + 1];//\u5c06\u76f8\u5bf9\u8f83\u5c0f\u7684\u5143\u7d20\u8d4b\u503c\u7ed9\u4e2d\u95f4\u5143\u7d20
New_number[j + 1] = New_number[j];//\u5c06\u76f8\u5bf9\u8f83\u5927\u7684\u5143\u7d20\u9001\u8fbe\u524d\u9762\u4e00\u4e2a\u4f4d\u7f6e
New_number[j] = k;//\u5c06\u4e2d\u95f4\u53d8\u91cf\u5143\u7d20\u9001\u7ed9\u540e\u9762\u4e00\u4e2a\u4f4d\u7f6e
}
}
printf("min-->max\uff1a\n");//\u6587\u5b57\u63d0\u793a
for (m = 0; m <= 9; m++)//\u4f9d\u6b21\u4ece\u5c0f\u5230\u5927\u8f93\u51fa
printf("%d ", number[m]);//\u8f93\u51fa\u5143\u7d20
printf("\n");
printf("max-->min\uff1a\n");//\u6587\u5b57\u63d0\u793a
for (m = 0; m <= 9; m++)//\u4f9d\u6b21\u4ece\u5927\u5230\u5c0f\u8f93\u51fa
printf("%d ", New_number[m]);//\u8f93\u51fa\u5143\u7d20
printf("\n");
return 0;
}
\u7a0b\u5e8f\u8fd0\u884c\u7ed3\u679c\u5982\u4e0b\uff1a
\u6269\u5c55\u8d44\u6599\uff1a
\u5176\u4ed6\u7b80\u5355\u5b9e\u73b0\u7a0b\u5e8f\uff1a
#include
int main()
{
int a[10]={0};
int i,j,temp;
for(i = 0;i<10;i++)
{
scanf("%d",&a[i]);
}
for(i = 0;i<10;i++)
{
for(j = 0;j<10-i-1;j++)
{
if(a[j]>a[j+1])
{
temp = a[j];
a[j] = a[j+1];
a[j+1] = temp;
}
}
}
for(i = 0;i<10;i++)
printf("%d ",a[i]);
return 0;
}
\u6839\u636e\u9898\u610f\u53ef\u5f97\u4ee3\u7801\uff1a
#include#define N 10int main(){ int a[N], i, j, k; //\u8f93\u5165 for(i = 0; i a[j]){ k = j; } } if (k != i){ j = a[k]; a[k] = a[i]; a[i] = j; } } //\u8f93\u51fa for (i = 0; i < N; ++i){ printf ("%d ", a[i]); } printf ("\n"); return 0;}
已测试，结果如图所示
#include<stdio.h>
int main()
{
int a[6]={0,0,0,0,0,0},temp,i,j;
char ch;
scanf("%d",&temp);
ch=getchar();
while(ch!='
'){
a[temp-5]++;
scanf("%d",&temp);
ch=getchar();
}
a[temp-5]++;
for(i=0;i<6;i++)
for(j=0;j<a[i];j++)
printf("%d ",i+5);
printf("
");
return 0;
}
#include<stdio.h>
int main()
{
int a[5];
int i,j,min;
printf("原数列:");
for(i=0;i<5;i++)
{
scanf("%d",&a[i]);
}
for(i=0;i<5;)
{
min=a[i];
for(j=i+1;j<5;j++)
{
if(min>a[j])
{
min=a[j];
a[j]=a[i];
}
a[i]=min;
}
printf("%d\t",a[i]);
i++;
}
return 0;
}
绛旓細杩欐槸涓绉嶆渶鍘熷鐨勬帓搴忕畻娉曪紝姣旇緝鎺ヨ繎浜庨夋嫨鎺掑簭锛屽嵆姣忔閫夊嚭涓涓渶灏忕殑鍏冪礌鏀惧埌a[i]鐨勪綅缃紝鐒跺悗瀵筧[i+1]~a[9]鐨勫厓绱犲啀閲嶅涓婅堪鎿嶄綔锛岀洿鍒板畬鎴愭暣涓帓搴忚繃绋嬨備絾鏄繖涓帓搴忕畻娉曞仛浜嗗緢澶氭棤鐢ㄧ殑浜ゆ崲鎿嶄綔锛屾氮璐逛簡寰堝鏃堕棿銆傚杩欎釜寰幆杩囩▼杩涜鏀硅繘鍙互鍙樻垚鏍囧噯鐨勯夋嫨鎺掑簭鎴栨槸鍐掓场鎺掑簭銆
绛旓細while(i<length){ min=&a[i];for(p=a+i;p<a+length;p++){if(*p<*min){temp=*min;min=*p;p=temp;} } i++;} } 閫夋嫨鎺掑簭娉曞氨鏄鎶婃暟缁鐨勬渶灏忕殑鍏冪礌鎵剧殑鐒跺悗鏀惧埌鏁扮粍鐨勬渶鍓嶉潰 灏辨槸绗竴灏忕殑鏀惧埌鏈鍓嶉潰 鐒跺悗缁х画浠庡悗闈㈡壘鍦ㄦ渶灏忕殑鏀惧埌鍓╀笅鍏冪礌鐨勬渶鍓嶉潰 涓鐩村惊鐜洿鍒版渶鍚庝竴涓 2 鍐掓场...
绛旓細include<stdio.h>#include<stdlib.h>void select_sort(int *a, int n){ int i, j, min, t; for( i =0; i < n -1; i ++){ min = i; //鏌ユ壘鏈灏忓 for( j = i +1; j < n; j ++) if( a[min] > a[j])min = j; //浜ゆ崲 if( min !=...
绛旓細鏍规嵁棰樻剰鍙緱浠ｇ爜锛歩nclude<stdio.h>#define N 10int main(){ int a[N], i, j, k; //杈撳叆 for(i = 0; i < N; ++i){ scanf ("%d", &a[i]); } //閫夋嫨鎺掑簭 for (i = 0; i < N-1; ++i){ k = i; for (j = i+1; j < N; ++j)...
绛旓細閬嶅巻鏁扮粍锛屾壘涓涓渶灏忕殑锛屾斁鍦╝[0]锛岀户缁亶鍘嗗墿浣欑殑鏁扮粍锛屾壘鍑虹浜屽皬鐨勶紝鏀惧湪a[1]void selectSort(int a[], int n) { int i, j, nMinIndex;for (i = 0; i < n; i++) { //鎬诲叡鎵緉娆 nMinIndex = i; //鍏堟妸绗竴涓厓绱犺涓烘渶灏忓厓绱 for (j = i + 1; j < n; ...
绛旓細涔熷嵆a[k]鍙樹负3浜嗭紝浣嗘槸a[1]渚濈劧涓嶅彉锛岃繕鏄=4 缁撴灉灏辨槸a[k]鏄痑[1]鍜宎[2]閲岄偅涓緝灏忕殑鍊 褰撶劧灏变笉鑳界敤a[k]=a[j]鏇夸唬鍟︼紝鍥犱负浼氭姽闄[k]鍘熸湁鐨勬暟鎹 杩欑鎺掑簭鏂规硶鍐嶅姞涓猧f灏眕erfect浜嗭細void sort (int a[],int n){int i,j,k,t;for(i=0;i<n-1;i++){ k=i; for...
绛旓細include<stdio.h> void main(){ int a[15],i,j,temp;printf("Input 15 numbers:\n");for(i=0;i<15;i++)scanf("%d",&a[i]);for(i=0;i<14;i++)//鍐掓场鎺掑簭 for(j=0;j<14-i;j++)if(a[j]>a[j+1]){ temp=a[j];a[j]=a[j+1];a[j+1]=temp;} for(i=0;i<...
绛旓細const void *b) { return *(char*)a - *(char*)b; // 杩欓噷璁颁綇涓瀹氳鐢ㄦ帓搴忕殑鍏冪礌绫诲瀷鐨勬寚閽堝仛寮哄埗瑁呮崲骞朵笖鍐嶅彇鎸囬拡鎸囧悜鐨勫笺倉int main() { char s[] = "kjferu21398dyfkaqpoia"; qsort(s, strlen(s), 1, cmp); printf("%s", s); return 0;} ...
绛旓細int main(){ int a[10];int i,j,k;printf("input 10 numbers:\n");for(i=0;i<10;i++锛墈//杈撳叆鍗佷釜鏁帮紝涓娆″惊鐜緭鍏10娆 scanf("%d",&a[i]);printf("\n");//鎹㈣ for(j=0;j<9;j++)//浠庡皬鍒板ぇ鎹㈣缁忓吀鏂规硶鍥涜 for(i=0;i<9;i++)if(a[i]>a[i+1]){t=a[i];...
绛旓細鏁扮粍鐨4绉嶅０鏄庢柟寮忥細1.鍏堝０鏄庡啀鍒濆鍖栦緥濡傦細//1.澹版槑int[] nums;//鍒濆鍖杗ums = new int[5];2.澹版槑骞跺垵濮嬪寲渚嬪锛//2.澹版槑銆佸垵濮嬪寲int[] nums = new int[10];3.鍒涘缓鏁扮粍鍚屾椂璧嬪间緥濡傦細//3.鍒涘缓鏁扮粍鍚屾椂璧嬪糞tring[] names=new String[]{"澶у悕","灏忕背","澶忛洦鑽"};int[] ages=new ...
