用C语言编写一个程序，将一个数组内下标为奇数的数组元素按照从小到大的顺序排序。 C语言编程:实现将任意一个给定的字符数组中下标值为奇数的元素...
\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;
}
\u8fd9\u6837\uff0c\u6211\u7ed9\u4f60\u5b9e\u73b0\u65b9\u6cd5\uff1a
\u5728\u539f\u6765\u7684\u6570\u7ec4\u57fa\u7840\u4e0a\uff0c\u5728\u6dfb\u52a0\u4e00\u4e2a\u6570\u7ec4(str)
\u4f7f\u7528FOR\u5faa\u73af\uff0c\u5faa\u73af\u8f93\u51fa\u539f\u6765\u7684\u6570\u7ec4\uff08\u4f46\u628a\u90a3\u4e2ai++\u6539\u4e3ai=i+2,\u8fd9\u6837\u5c31\u53d6\u5f97\u4e86\u5947\u6570\u4f4d\u7684\u503c\uff09
\u7528\u65b0\u7684\u6570\u7ec4\u50a8\u5b58\u8fd9\u4e9b\u5b57\u7b26\u4e32
\u7136\u540e\u5bf9\u65b0\u7684\u6570\u7ec4\u8fdb\u884c\u6392\u5e8f\u64cd\u4f5c
\u5982\uff1astring temp=str[0];
\u5faa\u73af\u65b0\u7684\u6570\u7ec4\uff0c\u5728\u91cc\u9762\u8fdb\u884c\u5224\u6bb5\u548c\u6392\u5e8f\u6362\u4f4d
\u6700\u540e\u5728\u8fdb\u884c\u5bf9\u539f\u6570\u7ec4\u7684\u5faa\u73af\u64cd\u4f5c\u5c06\u539f\u6765\u7684\u5947\u6570\u4e3a\u7684\u503c\u66ff\u6362\u4e3a\u65b0\u6570\u7ec4\u7684\u503c
\u5c31\u53ef\u4ee5\u4e86
\u5982\u6709\u5b9e\u73b0\u4e0a\u7684\u95ee\u9898\uff0c\u53ef\u4ee5\u7ee7\u7eed\u95ee\uff0c\u6211\u4e00\u822c\u5728\u7ebf
#include<stdio.h>
int main()
{
int a[7] ;
int i , j , temp ;
for( i = 0 ; i < 7 ; i ++ )
{
scanf("%2d" , &a[i] ) ;
}
for( i = 1 ; i < 7 - 1 ; i += 2)
{
for( j = 1 ; j < 7 - 1 - i ; j += 2)
{
if(a[j] > a[j+2])
{
temp = a[j] ;
a[j] =a[j+2] ;
a[j+2] = temp ;
}
}
}
for( i = 0 ; i < 7 ; i ++ )
{
printf("%2d " , a[i] ) ;
}
return 0 ;
}
绛旓細include<stdio.h> int main(){ int a[5]={8,6,5,4,1},i,n=5,temp;for(i=0;i<n/2;i++){ temp=a[i];a[i]=a[n-i-1];a[n-i-1]=temp;} for(i=0;i<n;i++){ printf("%d\t",a[i]);} system("pause");return 0;} ...
绛旓細瑕佹槸鏈変粈涔绋嬪簭鍐鐨勪笉瓒崇殑璇,,,鏈璧风爜缂栧啓鎬濇兂浣犲緱鎻愬彇涓涓嬪挴~! 鏈洖绛旂敱鎻愰棶鑰呮帹鑽 涓炬姤| 绛旀绾犻敊 | 璇勮 21 0 鍐呰挋浜篲yanjun 閲囩撼鐜:27% 鎿呴暱: 缂栫▼璇█ 鍏朵粬鍥炵瓟 #include<stdio.h>#define X 10;x涓烘暟缁勯暱搴﹁鏀圭洿鎺ユ敼鍚庨潰鐨鏁板瓧void main(){ int array[X+1]; //闀垮害涓簒+1,鏈鍚涓涓鍏...
绛旓細浣犲彲浠ヤ娇鐢ㄦ潯浠惰鍙ワ紙if-else璇彞锛夋潵鍒ゆ柇杈撳叆鐨勬暟n鏄皬浜0銆佺瓑浜0杩樻槸澶т簬0銆備笅闈㈡槸涓涓娇鐢–璇█缂栧啓鐨勭ず渚绋嬪簭锛歚``c include <stdio.h> int main() { double n;printf("璇疯緭鍏涓涓暟锛");scanf("%lf", &n);if (n < 0) { printf("杈撳叆鐨勬暟鏄礋鏁癨n");} else if (n == 0)...
绛旓細include <stdio.h>int Func(int n){if(n < 2)return 1;else return n*Func(n-1);} void main(){int n =0,m=0;printf("璇疯緭鍏涓涓姝ｆ暣鏁帮細")scanf("%d",&n);m=Func(n);printf("%d!=%d\n",n,m);} 鍦ㄤ互涓绋嬪簭浠ｇ爜涓紝Func锛堬級涓洪掑綊鍑芥暟锛屼富鍑芥暟main锛堬級涓帴鏀堕敭鐩樿緭鍏ユ暣鏁...
绛旓細鐢ㄩ夋嫨鎺掑簭娉缂栧啓c璇█锛瀹炵幇浠庨敭鐩樹笂杈撳叆10涓暟锛鎸変粠澶у埌灏忕殑椤哄簭鎺掑簭杈撳嚭銆備唬鐮佸涓嬶細include<stdio.h> int main(){ int i,j,a[10],t;printf("杈撳叆鏁");for (i = 0; i < 10; i++)scanf("%d",&a[i]);for (i = 0; i < 10; i++){ for (j = i + 1; j < 10;j...
绛旓細C绋嬪簭浠ｇ爜濡備笅锛氳В鏋愶細1銆侀鍏堝畾涔塧锛宐锛宑锛宮ax鍥涗釜鏁村瀷鍙橀噺锛屽苟杈撳叆a锛宐锛宑涓涓暟锛2銆佸畾涔夋渶澶у间负a锛宨f寰幆浣撹繕鏄b鍜宑杩涜寰幆锛3銆佹牴鎹惊鐜綋鍒ゆ柇鏈澶х殑鍊硷紝鏈鍚庤緭鍑虹粨鏋溿
绛旓細瀵瑰崐鍒嗭紝浜掓崲 鎸変綘鐨勮姹傦紝10涓暟锛璇诲彇鍒5锛岀劧鍚巃[i]鍜宎[9-i]浜掓崲 绋嬪簭锛歩nt main(){ int a[10]={12,3,11,1,4,21,15,25,18,22};int i,t;for(i=0;i<5;i++) //浜掓崲 { t=a[i];a[i]=a[9-i];a[9-i]=t;} for(i=0;i<10;i++)//杈撳嚭鎹㈠悗鐨勬暟缁 printf("%d...
绛旓細鐢ㄦ暟缁勪繚瀛樸傚畾涔涓涓暟缁勩傚锛歩nt a[6]={1,2,3,4,5,6};鐒跺悗杈撳嚭 for(i=0;i<6;i++){ printf("%d",a[i]);} 浠ｇ爜濡備笅锛歩nclude<stdio.h> int main(){ int a[6]={1,2,3,4,5,6};int i;for(i=0;i<=5;i++)printf("%d\n",a[i]);} ...
绛旓細include <stdio.h> int main(int argc, const char * argv[]) { int arr[4][4]={{25,36,78,13},{12,26,88,93},{75,18,22,32},{56,44,36,58}};int i,j,temp;printf("涓诲瑙掔嚎:\n");for(i=0;i<4;i++)printf("%d ",arr[i][i]);putchar('\n');printf("鍓...
绛旓細鏈汉涔熸槸瀛C璇█鐨勶紝浠ヤ笅鐨绋嬪簭鏄寜鐓т綘鐨勮姹缂栧啓鐨勶細#include <stdio.h> //姹傝緭鍏ユ暟鍚勪綅鏁扮殑绔嬫柟鍜 void main(){ int x,sum=0,j;printf("璇疯緭鍏ヤ竴涓鏁存暟锛");scanf("%d",&x); //杈撳叆涓涓暟 while(x!=0) //鍒ゆ柇X鏄惁涓洪浂 { j=x%10; //鍙栦釜浣嶆暟瀛 sum+=j*j*...
