用C语言或汇编语言编写一个将数组按由小到大的顺序排序的程序,并在DSP的CCS平台上调试。 编写C语言程序，把一个数组按从小到大的次序排列起来

\u7528c\u8bed\u8a00\u6216\u6c47\u7f16\u8bed\u8a00\u7f16\u5199\u4e00\u4e2a\uff1a\u5c06\u6570\u7ec4\u6309\u7531\u5c0f\u5230\u5927\u7684\u987a\u5e8f\u6392\u5217\u7684\u7a0b\u5e8f\u3002\u8981\u6c421\uff1a\u6570\u7ec4\u5143\u7d20\u7684\u4e2a\u6570\u7531\u952e\u76d8\u8f93\u5165\u3002

#include
#include

void Order(int *num,int n) //bubble sort
{
int s=0;
int tag = false ; // \u8bbe\u7f6e\u662f\u5426\u9700\u8981\u7ee7\u7eed\u5192\u6ce1\u7684\u6807\u5fd7\u4f4d
for ( int i = 0 ; i < n ; i++)
{
for ( int j = 0 ; j < n - i - 1 ; j++)
{
if ( num[j] > num[j+1])
{
tag = true ;
int temp = num[j] ;
num[j] = num[j+1] ;
num[j+1] = temp ;
}
}
if ( !tag )
break ;
}

}


int main()
{
printf("\u8f93\u5165\u6570\u636e:");
int a[10];
for (int i =0;i<10;i++)
{
scanf("%d",&a[i]);
}

Order(a,10);

printf("\n");

FILE *fp;
if((fp=fopen("d:\\test.txt","w"))==NULL) /*\u4ee5\u53ea\u5199\u65b9\u5f0f\u6253\u5f00\u6587\u4ef6*/
{
printf("cannot open file!\n");
exit(0);
}


for (int j = 0;j<10;j++)
{
fprintf(fp,"%d ",a[j]);
printf("%d",a[j]);
printf(" ");
}
printf("\n");
fclose(fp);

return 0;

}

\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;
}

#include<stdio.h>
#include<malloc.h>
int main()
{
int num;
printf("请输入元素的个数:");
scanf("%d",&num);
char *p=(char*)malloc(sizeof(char)*num);
for(int i=0;i<num;i++)
{
printf("请输入第%d个元素",i);
fflush(stdin);
scanf("%c",p+i);
}
for(int i=0;i<num;i++)
{
printf("%c ",*(p+i));
}
FILE *fp;
if(!(fp=fopen("a.txt","wb+")))
{
printf("打开文件失败");
return 1;
}
for(int i=0;i<num;i++)
{
fputc(*(p+i),fp);
}
return 0;
}
在ccs上已经调试了，还有不懂的话留邮箱！

#include<stdio.h>
void main()
{
int a[10],i,t,n,s;
for(i=0;i<=9;i++)
scanf("%d",&a[i]);
n=0;s=1;
while(n<=9)
{
for(s=n+1;s<=9;s++)
{if(a[s]<a[n]){t=a[s];a[s]=a[n];a[n]=t;}}
n++;
}
for(i=0;i<=9;i++)
printf("%d ",a[i]);
printf("\n");}

鐢姹囩紪璇█璁捐涓涓皢0-9鍗佷釜鏁扮疮鍔犵殑绋嬪簭,骞跺皢姣忎竴姝ヨ绠楁楠ゆ樉绀
绛旓細0 mov dl, 1$0: call printdec push ax mov al, '+' call printAl mov ah, 0 mov al, dl call printDec mov al, '=' call printAl pop ax add al,dl call printDec

鑳藉惁鐢╟璇█(杩樻湁姹囩紪璇█)缂栧啓鍑虹▼搴忔潵,鏄剧ず0~9涓嬮潰鏄數璺浘鍜屽師浠,鐢...
绛旓細if(++j==8) j=0; //姣忓睆涓涓暟瀛鐢8 涓瓧鑺傛瀯鎴 break;

缂栧啓涓娈C璇█涓庢眹缂栫▼搴忕殑鍥炲悎绋嬪簭,鐢ㄦ眹缂栫▼搴瀹炵幇涓や釜64浣嶆暟鐨勫姞娉...
绛旓細鏄細include <stdio.h> include <stdlib.h> int main();{ int a,b,c;scanf("%d %d",a,b);//杈撳叆a鍜宐鐨勫笺俢=a+b;//c鏄袱鏁颁箣鍜屻俻rintf("%d",c);//杈撳嚭c鐨勫笺俿ystem("pause");return 0;}

缂栧啓涓涓狢绋嬪簭,杈撳叆a,b,c涓変釜鍊,杈撳嚭鍏朵腑鏈澶ц呫
绛旓細int a,b,c,max;printf("璇疯緭鍏ヤ笁涓暟锛歕n");scanf("%d%d%d",&a,&b,&c);if(a>b)max=a;if(c>max)max = c;printf("涓変釜鏁颁腑鏈澶х殑鏁颁负锛%d",max);return 0;}

鐢╟缂栧啓绋嬪簭濡備綍灏1鍒100涓綅鏁版槸6鐨勬暟鎹緭鍑?
绛旓細澶勭悊浣庣骇瀛樺偍鍣ㄣ佷粎浜х敓灏戦噺鐨勬満鍣ㄧ爜浠ュ強涓嶉渶瑕佷换浣曡繍琛岀幆澧冩敮鎸佷究鑳借繍琛岀殑缂栫▼璇█銆C璇█鎻忚堪闂姣旀眹缂栬瑷杩呴熴佸伐浣滈噺灏忋佸彲璇绘уソ銆佹槗浜庤皟璇曘佷慨鏀瑰拰绉绘锛岃屼唬鐮佽川閲忎笌姹囩紪璇█鐩稿綋銆侰璇█涓鑸彧姣姹囩紪璇█浠ｇ爜鐢熸垚鐨勭洰鏍囩▼搴忔晥鐜囦綆10%-20%銆傚洜姝わ紝C璇█鍙互缂栧啓绯荤粺杞欢銆

c璇█,灏涓涓姝ｆ暣鏁板垎瑙ｈ川鍥犳暟銆備緥濡:杈撳叆90,鎵撳嵃鍑90=2*3*3*5...
绛旓細C璇█鏄竴绉嶈绠楁満绋嬪簭璁捐璇█锛屽畠鏃㈠叿鏈夐珮绾ц瑷鐨勭壒鐐癸紝鍙堝叿鏈姹囩紪璇█鐨勭壒鐐广傚畠鐢辩編鍥借礉灏旂爺绌舵墍鐨凞.M.Ritchie浜1972骞存帹鍑猴紝1978骞村悗锛孋璇█宸插厛鍚庤绉绘鍒板ぇ銆佷腑銆佸皬鍙婂井鍨嬫満涓婏紝瀹冨彲浠ヤ綔涓哄伐浣滅郴缁熻璁¤瑷锛缂栧啓绯荤粺搴旂敤绋嬪簭锛屼篃鍙互浣滀负搴旂敤绋嬪簭璁捐璇█锛岀紪鍐欎笉渚濊禆璁＄畻鏈虹‖浠剁殑搴旂敤绋嬪簭銆侰璇█...

鐢–璇█缂栧啓:缂栧啓涓涓鍑芥暟,瑕佹眰鍦ㄤ富鍑芥暟涓緭鍏ヤ袱涓暟,杈撳嚭鍏朵腑鏈澶у...
绛旓細C璇█浠ｇ爜濡備笅锛歩nclude<stdio.h> int main(){ int a,b;printf("please enter two number:"); ---涓涓暟瀛鐢ㄧ┖鏍奸殧寮锛屼互鍥炶溅閿粨鏉熻緭鍏ャ俿canf("%d %d",&a,&b);if(a>b)printf("The max is %d",a);else if(b>a)printf("The max is %d",b);else printf("The two Numbers...

缂栧啓涓涓▼搴,璁＄畻100+101+鈥+300鐨勫
绛旓細鍙互鐢–璇█鍐锛歩nclude<iostream> using namespace std;int main(){ int res = 0;for (int i = 100; i <= 300; i++){ res += i;} cout << "The sum from 100 to 300 is " << res << endl;return 0;} 缁撴灉涓猴細

濡備綍鐢–璇█杈撳叆11涓暣鏁?
绛旓細44闄や互11鍟4锛屼綑0锛屾墍浠ユ浠ｇ爜鐨勬牎楠屼綅鏄0锛屼篃灏辨槸鏂颁唬鐮佷负23450銆傛暟鎹粨鏋勪腑瀛楃涓插鏋滄槸鍥哄畾闀垮害鐨勫彲浠ヤ笉鐢ㄥ垵濮媎鍖 濡傛灉鏄彲鍙橀暱搴︾殑璇蜂娇鐢ㄦ寚閽堬紝杩涜缂栫▼锛屾墍浠ユ病娉曠粰绋嬪簭锛氳鏄c鐨勮瘽 typedef struct{ char** astr;}mystruct;char ad[]="aaaaaaaaaaa";mystruct ms;ms.astr=&ad;...

c璇█鍜屾眹缂栬瑷娣峰悎缂栫▼,閿洏杈撳叆4涓崄杩涘埗鏁,鐢ㄦ眹缂栬瑷璁＄畻杩欏洓
绛旓細ahcall dispnummov ah,4chint 21h; 閿洏杈撳叆鏁板兼暟缁勫瓙绋嬪簭锛堟暟缁勫悕涓篴rray锛屽厓绱犱釜鏁板瓨鏀惧湪num涓級inputnum proc near ; 杈撳叆鐨勬暟鎹互涓涓┖鏍煎垎闅旓紝浠ュ洖杞︾缁撴潫杈撳叆 lea di,array ;灏嗘暟缁勭涓涓厓绱犵殑鏈夋晥鍦板潃缃叆DI mov word ptr[num],0stin: mov ax,0 push axagain1: ...

扩展阅读：c++语言入门自学 ... c++入门程序代码 ... c++和python先学哪个 ... c语言编写一个小游戏 ... 编程语言排名2024 ... c++编程 ... c语言编写一个计算器 ... 十大编程语言排名 ... c++简单程序实例 ...