C语言实现动态输入10个数字进行排序并输出。
\u8f93\u516510\u4e2a\u6570\uff0c\u7528\u5192\u6ce1\u6392\u5e8f\u6cd5\u6309\u7531\u5c0f\u5230\u5927\u987a\u5e8f\u6392\u5e8f\u5e76\u8f93\u51fa\uff1f\uff1fc\u8bed\u8a00\u7684\u5192\u6ce1\u6392\u5e8f\u7684\u7a0b\u5e8f\u4ee3\u7801\u5982\u4e0b\uff1a
#include
int main()
{
int a[10]={0};
int i=0,j=0,t=0;
for(i=0;i<10;i++)
{scanf("%d",&a[i]);}
for(i=0;i<10;i++)
{for(j=0;j<10-i;j++){
if(a[j]>a[j+1])
{
t=a[j];
a[j]=a[j+1];
a[j+1]=t;
}}}
for(i=0;i<10;i++)
{printf("%d ",a[i]);}
return 0;}
\u4efb\u610f\u8f93\u5165\u5341\u4e2a\u6570\u636e\uff0c\u7a0b\u5e8f\u8fd0\u884c\u7ed3\u679c\uff1a
\u6269\u5c55\u8d44\u6599\uff1a
\u5192\u6ce1\u6392\u5e8f\u7b97\u6cd5\u7684\u539f\u7406\u5982\u4e0b\uff1a
1\u3001\u6bd4\u8f83\u76f8\u90bb\u7684\u5143\u7d20\u3002\u5982\u679c\u7b2c\u4e00\u4e2a\u6bd4\u7b2c\u4e8c\u4e2a\u5927\uff0c\u5c31\u4ea4\u6362\u4ed6\u4eec\u4e24\u4e2a\u3002
2\u3001\u5bf9\u6bcf\u4e00\u5bf9\u76f8\u90bb\u5143\u7d20\u505a\u540c\u6837\u7684\u5de5\u4f5c\uff0c\u4ece\u5f00\u59cb\u7b2c\u4e00\u5bf9\u5230\u7ed3\u5c3e\u7684\u6700\u540e\u4e00\u5bf9\u3002\u5728\u8fd9\u4e00\u70b9\uff0c\u6700\u540e\u7684\u5143\u7d20\u5e94\u8be5\u4f1a\u662f\u6700\u5927\u7684\u6570\u3002
3\u3001\u9488\u5bf9\u6240\u6709\u7684\u5143\u7d20\u91cd\u590d\u4ee5\u4e0a\u7684\u6b65\u9aa4\uff0c\u9664\u4e86\u6700\u540e\u4e00\u4e2a\u3002
4\u3001\u6301\u7eed\u6bcf\u6b21\u5bf9\u8d8a\u6765\u8d8a\u5c11\u7684\u5143\u7d20\u91cd\u590d\u4e0a\u9762\u7684\u6b65\u9aa4\uff0c\u76f4\u5230\u6ca1\u6709\u4efb\u4f55\u4e00\u5bf9\u6570\u5b57\u9700\u8981\u6bd4\u8f83\u3002
1\u3001\u6570\u7ec4\u5f62\u5f0f\u3002
\u89e3\u9898\u601d\u8def\uff1a \u5224\u65ad\u6bd4\u8f83\u7684\u8eba\u6570\uff0c\u6bcf\u8d9f\u76f8\u90bb\u7684\u4e24\u4e2a\u6570\u518d\u8fdb\u884c\u6bd4\u8f83\uff0c\u5e94\u7528\u4e24\u6b21 for \u5faa\u73af
\u5177\u4f53\u4ee3\u7801\uff1a
void PrintArr(int* arr, int sz)
{
int i = 0;
for (i = 0; i < sz; i++)
{
printf("%d ", *(arr + i));
}
return 0;
}
void BubbleSort(int arr[],int sz)
{
int i = 0;
for (i = 0; i < sz - 1; i++)
{
int j = 0;
for (j = 0; j < sz - i - 1; j++)//\u7528for\u5faa\u73af\u7684\u5143\u7d20\u4e2a\u6570\u63a7\u4f4f\u591a\u5c11\u8d9f
{
if (arr[j] > arr[j + 1])
{
int tmp = arr[j];
arr[j] = arr[j+1];
arr[j + 1] = tmp;
}
}
}
}
int main()
{
int arr[10] = { 9, 8, 7, 6, 5, 4, 3, 2, 1, 0 };
int sz = sizeof(arr) / sizeof(arr[0]);
BubbleSort(arr, sz);
PrintArr(arr, sz);
system("pause");
return 0;
}
2\u3001\u6307\u9488\u5f62\u5f0f\u3002
\u521b\u5efa\u4e24\u4e2a\u53d8\u91cfstart\u3001end\uff0c\u8bb0\u4f4f\u6570\u7ec4\u8d77\u59cb\u4e0e\u7ed3\u675f\u4f4d\u7f6e\u5143\u7d20\u7684\u5730\u5740\uff0c\u5e94\u7528\u4e24\u6b21 while \u5faa\u73af\u4ea4\u6362\u5730\u5740
\u6307\u9488\u5192\u6ce1\u6392\u5e8f \uff1a
void PrintArr(int* arr, int sz)
{
int i = 0;
for (i = 0; i < sz; i++)
{
printf("%d ", *(arr + i));
}
return 0;
}
void BubbleSort(int *arr, int sz)
{
int start = arr;
int end = arr + sz - 1;
//\u8d9f\u6570
while (start < end)
{
int *cur = start;
while (cur < end)
{
if (*cur > *(cur+1))
{
int tmp = *cur;
*cur = *(cur + 1);
*(cur + 1) = tmp;
}
cur++;
}
end--;
}
}
int main()
{
int arr[10] = { 9, 8, 7, 6, 5, 4, 3, 2, 1, 0 };
int sz = sizeof(arr) / sizeof(arr[0]);
BubbleSort(arr, sz);
PrintArr(arr, sz);
system("pause");
return 0;
}
\u6269\u5c55\u8d44\u6599\uff1a\u7b97\u6cd5\u539f\u7406
\u5192\u6ce1\u6392\u5e8f\u7b97\u6cd5\u7684\u539f\u7406\u5982\u4e0b\uff1a
\u6bd4\u8f83\u76f8\u90bb\u7684\u5143\u7d20\u3002\u5982\u679c\u7b2c\u4e00\u4e2a\u6bd4\u7b2c\u4e8c\u4e2a\u5927\uff0c\u5c31\u4ea4\u6362\u4ed6\u4eec\u4e24\u4e2a\u3002
\u5bf9\u6bcf\u4e00\u5bf9\u76f8\u90bb\u5143\u7d20\u505a\u540c\u6837\u7684\u5de5\u4f5c\uff0c\u4ece\u5f00\u59cb\u7b2c\u4e00\u5bf9\u5230\u7ed3\u5c3e\u7684\u6700\u540e\u4e00\u5bf9\u3002\u5728\u8fd9\u4e00\u70b9\uff0c\u6700\u540e\u7684\u5143\u7d20\u5e94\u8be5\u4f1a\u662f\u6700\u5927\u7684\u6570\u3002
\u9488\u5bf9\u6240\u6709\u7684\u5143\u7d20\u91cd\u590d\u4ee5\u4e0a\u7684\u6b65\u9aa4\uff0c\u9664\u4e86\u6700\u540e\u4e00\u4e2a\u3002
\u6301\u7eed\u6bcf\u6b21\u5bf9\u8d8a\u6765\u8d8a\u5c11\u7684\u5143\u7d20\u91cd\u590d\u4e0a\u9762\u7684\u6b65\u9aa4\uff0c\u76f4\u5230\u6ca1\u6709\u4efb\u4f55\u4e00\u5bf9\u6570\u5b57\u9700\u8981\u6bd4\u8f83\u3002
#include <stdlib.h>
#include <string.h>
void Swap(int *a,int *b)
{
int tmp ;
tmp = *a;
*a = *b;
*b = tmp;
}
void Sort(int a[],int size,int val)
{
int i,j;
for(i=0;i<size-1;i++)
for(j=i+1;j<size;j++)
{
if(val==1)//降序排列
{
if(a[i]<a[j])
Swap(&a[i],&a[j]);
}
else if(val==2)//升序排列
{
if(a[i]>a[j])
Swap(&a[i],&a[j]);
}
}
}
int main()
{
int arr[11];
int i,len,flag;
char str[50],num[5];
for(i=0;i<10;i++)
{
printf("please input %d num:",i+1);
memset(str,0,50);
scanf("%s",str);
len = strlen(str);
flag = 1;
while(len--)
{
if(str[len]=='-') continue;
if(str[len]<'0'||str[len]>'9')
{
printf("input error!\n");
i--;
flag=0;
break;
}
}
if(flag)
{
if(strlen(str)>4)
{
strncpy(num,str,4);
num[4]='\0';
arr[i] = atoi(num);
}
else arr[i] = atoi(str);
//printf(" %d ",arr[i]);
}
}
printf("old data is :");
for(i=0;i<10;i++)
{
printf(" %d ",arr[i]);
}
printf("\r\n");
Sort(arr,10,1);
printf("new data is :");
for(i=0;i<10;i++)
{
printf(" %d ",arr[i]);
}
printf("\r\n");
return 0;
}
楼主 求分 写出来不容易啊
我想知道什么是动态输入？
绛旓細printf("old data is :");for(i=0;i<10;i++){ printf(" %d ",arr[i]);} printf("\r\n");Sort(arr,10,1);printf("new data is :");for(i=0;i<10;i++){ printf(" %d ",arr[i]);} printf("\r\n");return 0;} 妤间富 姹傚垎 鍐欏嚭鏉ヤ笉瀹规槗鍟 ...
绛旓細define MAXSIZE 10 void Fun(int a[]){ int i;int temp;int MaxNum=a[0];int maxIndex = 0;int minIndex = 0;int MinNum=a[0];for(i=0;i<10;i++){ if(a[i]>MaxNum){ MaxNum=a[i];maxIndex = i;}else if(a[i]<MinNum){ MinNum=a[i];minIndex = i;} } temp ...
绛旓細1銆佺敤malloc鍒嗛厤涓鍧楃┖闂达紝姣斿int* a = (int*) malloc( 10*sizeof(int) );鐒跺悗鍙互褰撴垚濂藉儚鏄暟缁勪竴鏍蜂娇鐢紝姣斿a[2] = 5;2銆佺劧鍚庝綘闇瑕佸闀跨殑鏃跺欙紝灏辩敤realloc( a, 20*sizeof(int))鎵╁睍绌洪棿銆備笉杩囨瘡涓娆℃墿灞曢兘浼氭湁涓娆℃嫹璐濓紝鐩稿綋浜庡垎閰嶄竴鍧楁柊鐨勭┖闂达紝鐒跺悗鎶婂師鏉ョ殑鏁版嵁鎷疯礉杩囧幓锛屾墍浠ユ暟缁...
绛旓細杩欓噷鎴戜滑鍏堝缓涓涓浐瀹氶暱搴︾殑鏁扮粍锛屽涓嬪浘锛屾暟缁勯暱搴︿负1000 鐒跺悗灏遍渶瑕佺敤鍒板惊鐜簡锛屽苟涓旇缃竴涓寜閿滃洖杞﹂敭鈥濊烦鍑哄惊鐜傝繖鏍凤紝涓嶆柇寰幆灏卞彲浠ヤ笉鏂湴灏鏁板瓧瀛樿繘鏁扮粍閲屻傚綋鎴戜滑鎸夊洖杞﹂敭鐨勬椂鍊欏氨浼氳烦鍑哄惊鐜紝缁撴潫杈撳叆銆傝岃緭鍏ョ殑鏁版嵁灏变細淇濆瓨鍦╪um鏁扮粍涔嬩腑锛屽敮涓鐨勭己鐐瑰氨鏄暟缁勯暱搴︽槸鍥哄畾鐨勩
绛旓細鍔ㄦ鏁扮粍锛屽洜涓轰笉鐭ラ亾浣犳槸鍥哄畾闀垮害杩樻槸鍙橀暱锛屽鏋滃浐瀹氶暱搴︾洿鎺 int a[n]灏卞彲浠ワ紝绗簩锛岃偗瀹氭槸寰幆鑾峰彇杈撳叆鐨鏁板瓧锛屽綋鐒惰偗瀹氫綘杈撳叆瀹屽悗瑕佽緭鍏ヤ竴涓粨鏉熺銆傛病鏈夌鍒扮粨鏉熺锛屽氨浼氫竴鐩村惊鐜瓑寰呰緭鍏ャ傚綋鐒跺鏋滈暱搴>5锛屽氨闇瑕佸湪寮杈熺┖闂翠簡锛屽叿浣撶湅c鐨勫嚱鏁般備袱涓暟缁勬瘮杈冨氨鏇寸畝鍗曚簡锛屽叿浣撶湅浣犳兂鎬庝箞姣旇緝浜 ...
绛旓細//鍔ㄦ鍒嗛厤鍐呭瓨 include <stdio.h> include <stdlib.h> include <iostream.h> void sort( int * s,int len);void main(){ int n,i,tsum=0;float k;//printf("璇杈撳叆涓暟n:\n");//scanf("%d",&n);n=10;int * choice=(int *) malloc ( sizeof(int) * n );printf("璇疯緭鍏...
绛旓細printf("璇杈撳叆鍗佷釜鏁锛歕n");for(i=0;i<10;i++){ scanf("%d",&a[i]);} fun(a,10);printf("閲嶆柊鎺掑簭锛歕n");for(i=0;i<10;i++){ printf("%d ",a[i]);} printf("\n");printf("璇疯緭鍏ヤ竴涓彃鍏ョ殑鏁帮細\n");scanf("%d",&k);for(i=0;i<10;i++){ b[i]=a[i]...
绛旓細濡傛灉闄愬埗浜C璇█鐨勮瘽銆傞偅涔堝氨涓嶆槸寰堟柟渚夸簡銆備絾鏄槸鏈夋柟娉曠殑锛氭湁鍙玬alloc,realloc鐨勫嚱鏁帮紝鍦ㄥご鏂囦欢<stdlib.h>鎴栬<malloc.h>閲岄潰(鐪嬬紪璇戝櫒)銆傜粰浣犱竴涓垜鍐欑殑浠ｇ爜銆備綘鐪嬬潃鎬庝箞鐢ㄣ傚彲浠杈撳叆浠绘剰鏁伴噺鐨刬nt鍨鏁板瓧锛岀劧鍚庣洿鎺ヨ緭鍑恒傛祴璇曞钩鍙帮細Devc++ 杈撳叆锛20 10 50 30 ctrl+z(閿洏ctrl閿紝琛ㄧず杈撳叆缁撴潫...
绛旓細int ListCount(); //缁熻褰撳墠閾捐〃鐨勮褰曟绘暟锛岃繑鍥炰竴涓暣鏁 void AddItem(int num, string name, int mark); //娣诲姞涓鏉¤褰曞埌琛ㄥ熬void RemoveItem(int); //鍒犻櫎涓鏉℃寚瀹氱殑璁板綍 void List(); //鍒楀嚭褰撳墠閾捐〃涓殑鎵鏈夎褰 void Sort(); //瀵瑰綋鍓嶉摼琛ㄨ繘琛屾帓搴 void Search(int); //鍦ㄥ綋鍓...
绛旓細1銆侀鍏堝湪鐢佃剳涓墦寮缂栬瘧鍣紙vc++6.0锛夛紝鏂板缓涓涓皢1鍒100淇濆瓨鍒版暟缁勪腑椤圭洰锛屽鍥炬墍绀恒2銆佹坊鍔犱竴涓 assignment.c 鏂囦欢锛屽鍥炬墍绀恒3銆佸寘鍚玸tdio.h鍜宻tdlib.h澶存枃浠讹紝濡傚浘鎵绀恒4銆杈撳叆main鍑芥暟涓讳綋鍙婅繑鍥炲硷紝濡傚浘鎵绀恒5銆佸畾涔変竴涓猚har鏁扮粍锛岄暱搴︿负100锛屾渶鍚庝娇鐢╳hile寰幆杩涜璧嬪硷紝濡傚浘鎵绀猴紝灏卞畬鎴...
