用c语言编程：键盘上输入N个整数，使该数组中的数按照从小到大的次序排列（选择法排序） 在键盘上输入n个整数，试编程使该数组中的数按照从大到小的次序...
C\u8bed\u8a00\u9898\uff0c\u5728\u952e\u76d8\u4e0a\u8f93\u5165N\u4e2a\u6574\u6570,\u8bd5\u7f16\u5236\u7a0b\u5e8f\u4f7f\u8be5\u6570\u7ec4\u4e2d\u7684\u6570\u6309\u7167\u4ece\u5927\u5230\u5c0f\u7684\u6b21\u5e8f\u6392\u5217\uff0c\u8981\u6c42\u7528\u5192\u6ce1\u6cd5\uff0c\u9009\u62e9\u6cd5#include
main()
{
int a[10],i,j,t;
printf("Please input 10 numbers: ");/*\u8f93\u5165\u6e90\u6570\u636e*/
for(i=0;i<10;i++)
scanf("%d",&a[i]); /*\u6392\u5e8f*/
for(j=0;j<9;j++) /*\u5916\u5faa\u73af\u63a7\u5236\u6392\u5e8f\u8d9f\u6570\uff0cn\u4e2a\u6570\u6392n-1\u8d9f*/
for(i=0;i<9-j;i++) /*\u5185\u5faa\u73af\u6bcf\u8d9f\u6bd4\u8f83\u7684\u6b21\u6570\uff0c\u7b2cj\u8d9f\u6bd4\u8f83n-j\u6b21*/
if(a[i]>a[i+1])
/*\u76f8\u90bb\u5143\u7d20\u6bd4\u8f83\uff0c\u9006\u5e8f\u5219\u4ea4\u6362*/
{ t=a[i];
a[i]=a[i+1];
a[i+1]=t;
}/*\u8f93\u51fa\u6392\u5e8f\u7ed3\u679c*/
printf("The sorted numbers: ");
for(i=0;i<10;i++)
printf("%d ",a[i]);
printf("\n");
}
\u63d0\u4f9b\u4e00\u4e2a\u5192\u6ce1\u6392\u5e8f\u6cd5\uff0c\u5df2\u901a\u8fc7\u7f16\u8bd1\uff0c\u4ec5\u4f9b\u53c2\u8003~
#include
#include
main()
{
int a[100],n,i,j,temp;
printf("Input number of integers\n");
scanf("%d",&n);
printf("Input integers in order\n");
for(i=0;i<n;i++) scanf("%d",&a[i]);
for(i=0;i<n-1;i++)
for(j=0;j<n-i-1;j++)
if(a[j]>a[j+1])
{
temp=a[j];
a[j]=a[j+1];
a[j+1]=temp;
}
for(i=n-1;i>=0;i--)
{
printf("%d",a[i]);
printf(" ");
}
printf("\n");
}
#include "stdio.h"
#define N 10
int main(int argc,char *argv[]){
int a[N],i,j,k;
printf("Please enter %d integer(s)...
",N);
for(i=0;i<N;scanf("%d",a+i++));//输入
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("%d ",a[i]);
}
printf("
");
return 0;
}
代码图片和运行样例：
#include <stdio.h>
main()
{
int a[10],i,j,t;
printf("Please input 10 numbers: ");/*输入源数据*/
for(i=0;i<10;i++)
scanf("%d",&a[i]); /*排序*/
for(j=0;j<9;j++) /*外循环控制排序趟数，n个数排n-1趟*/
for(i=0;i<9-j;i++) /*内循环每趟比较的次数，第j趟比较n-j次*/
if(a[i]>a[i+1])
/*相邻元素比较，逆序则交换*/
{ t=a[i];
a[i]=a[i+1];
a[i+1]=t;
}/*输出排序结果*/
printf("The sorted numbers: ");
for(i=0;i<10;i++)
printf("%d ",a[i]);
printf("\n");
}
绛旓細include <stdlib.h>long factorial(int n) { if(n <= 1) return 1;return n*factorial(n - 1);}int main() { int n;printf("璇杈撳叆涓涓鏁存暟 : ",&n);scanf("%d",&n);printf("\n%d! + (%d + 1)! = %u\n\n",n,n,factorial(n) + factorial(n + 1));return 0;} ...
绛旓細int a[N]={...},i;printf("璇杈撳叆鏁板硷細\n");for(i=0;i<N;i++)scanf("%d",a[i]);printf("閫嗗簭杈撳嚭鐨勭粨鏋滀负锛歕n");for(i=N-1;i>=0;i--)printf("%3d",a[i]);}
绛旓細i = 0;while (i < N){
绛旓細for(i=0; i<N; i++) //杈撳嚭宸叉帓濂藉簭鐨勬暟缁勫厓绱狅紝鍩熷涓哄乏瀵归綈3浣 printf("%-3d",a[i]);printf("\n");}
绛旓細void negasort(int *array,int n);//閫嗗簭瀛樻斁鍑芥暟 int main(){ int arry[20];int n;printf("璇杈撳叆鏁扮粍鍏冪礌涓暟锛");scanf("%d",&n);printf("璇疯緭鍏ユ暟缁勫厓绱狅細");for(int i=0;i<n;i++)scanf("%d",arry+i);negasort(arry,n);//璋冪敤閫嗗簭瀛樻斁鍑芥暟 for(int j=0;j<n;j++)prin...
绛旓細{ static int nRet = 0;nRet += n;return nRet;} int main(void){ int i = 1;int n = 1;int nResult = 0;scanf("%d:", &n);if ( n <= 0 ){ printf("invalid data!\n");} else { for (; i <= n; ++i ){ nResult += sum(i);} printf("%d\n", nResult);...
绛旓細int main(){ int *a,n,sum_even = 0,sum_odd = 0;printf("璇杈撳叆n鐨勫:");scanf("%d",&n);a = (int *)malloc(sizeof(int) * n);printf("璇疯緭鍏%d涓暣鏁癨n",n);for(int i = 0;i < n;i++){ scanf("%d",&a[i]);if(a[i] % 2)sum_odd++;else sum_even++;} ...
绛旓細printf("姝ゆ暟鍏辨湁%lu涓笉鍚屾鏁存暟鍥犲瓙銆俓n",cnt); return 0;} 鏈洖绛旂敱鎻愰棶鑰呮帹鑽 涓炬姤| 绛旀绾犻敊 | 璇勮 1 0 涓婂笣鏉ヨ嚜鍦扮悆 閲囩撼鐜:66% 鎿呴暱: C/C++ 姹囩紪璇█ 鍏朵粬缂栫▼璇█ 鐧惧害鐭ラ亾 鐗╃悊瀛 鍏朵粬鍥炵瓟 #include<stdio.h>int main(){ int n; int count=0; scanf("%d",&n); for(int i=1...
绛旓細void main(){int n =0,m=0;printf("璇疯緭鍏ヤ竴涓鏁存暟锛")scanf("%d",&n);m=Func(n);printf("%d!=%d\n",n,m);} 鍦ㄤ互涓婄▼搴忎唬鐮佷腑锛孎unc锛堬級涓洪掑綊鍑芥暟锛屼富鍑芥暟main锛堬級涓帴鏀閿洏杈撳叆鏁存暟鍊煎悗锛岃皟鐢‵unc锛堬級閫掑綊鍑芥暟锛岄灞俶=n*锛坣-1锛夛紒锛岀户缁掑綊璋冪敤锛宮=n*(n-1)(n-2)!锛...
绛旓細浠閿洏杈撳叆涓涓暣鏁癗锛圢>=0锛夛紝鐒跺悗鍐杈撳叆N涓鏁存暟锛 鎸変粠灏忓埌澶х殑椤哄簭杈撳嚭銆 姝ｅ湪瀛C璇█绋嬪紡璁捐锛屾眰鏁 #include<stdio.h> int main(void) { int n,i,j,t; printf("please enter anumber:\n"); scanf("%d",&n); int a[n]; printf("please enter %d number:\n",n)...
