C语言：用选择法对数组中5个整数按由小到大排序。 关于C语言，用选择法对数组中10个整数按由小到大排序
\u5173\u4e8eC\u8bed\u8a00\u7528\u9009\u62e9\u6cd5\u5bf9\u6570\u7ec4\u4e2d10\u4e2a\u6574\u6570\u6309\u7531\u5c0f\u5230\u5927\u6392\u5e8f\u7a0b\u5e8f\u662f\u597d\u7684\u3002\u6b63\u5e38\u8fd0\u884c\uff1a
#include
int main()
{
void sort(int arry[],int n);
int a[10],i;
printf("enter array:\n");
for(i=0;i<10;i++)
scanf("%d",&a[i]);
sort(a,10);
printf("the sorted array:\n");
for(i=0;i<10;i++)
printf("%d ",a[i]);
printf("\n");
return 0;
}
void sort (int array[],int n)
{
int i,j,k,t;
for(i=0;i<n-1;i++)
{
k=i;
for(j=i+1;j<n;j++)
if(array[j]<array[k])
k=j;
t=array[k];array[k]=array[i];array[i]=t;
}
}
d=k=i; \u4e0d\u80fd\u8fd9\u6837\u5199\uff0c\u8981\u5206\u5f00\u6765\uff1a
k=i;
d=i;
#include<stdio.h>
void main()
{
int i,j,k,t,a[15];
for(i=0;i<=14;i++)
scanf("%d",a[i]);
for(i=0;i<15;i++)
{k=i;
for(j=i+1;j<15;j++)
if(a[j]>a[k]) k=j;
if(k!=i)
{t=a[k];a[k]=a[i];a[i]=t;}
}
for(i=0;i<15;i++)
printf("%4d",a[i]);
}
#include <stdio.h>
#include <stdlib.h>
int main()
{
int a[5],b,c;
for(b=1;b<5;b++)
{
scanf("%d",&a[b]);
}
for(b=1;b<=4;b++)
{
if(a[b]>a[b++]) a[b++]=a[b];
else a[b++]=a[b++];
}
printf("%d",a[5]);
system("pause");
return 0;
}
a[5]={5,99,5,59,96}
for(int i =0;i<5;i++){
for (int j =i+1;j<5;j++){
if (a[i]>a[j]){
int k = a[i];
a[i]=a[j];
a[j]=k;
}
}
绛旓細鍦╩ain鍑芥暟涓畾涔夊彉閲忓拰鏁扮粍锛2銆佹帴涓嬫潵鐢╯canf鍑芥暟杈撳叆鐨10涓暟锛屽皢杈撳叆鐨勬暟瀛樺叆鍒板彉閲廰涓紝鎺ョ潃杩涜姣旇緝鎺掑簭锛屽鏋滃悗涓涓暟姣斿墠涓涓暟澶у垯鍒╃敤涓棿鍙橀噺t瀹炵幇淇╁间簰鎹紝鏈鍚庤緭鍑烘帓搴忕殑缁撴灉锛3銆佺紪璇戣繍琛岀▼搴忥紝杈撳叆浠绘剰鐨10涓暟锛屽洖杞﹀悗鍗冲彲鐪嬪埌鎺掑簭鍚庣殑缁撴灉銆備互涓婂氨鏄c璇█涓夋嫨鎺掑簭鐨勭敤娉曪細...
绛旓細浠ｇ爜鏂囨湰锛歩nclude "stdio.h"int main(int argc,char *argv[]){ int a[10]={7,9,1,5,3,4,2,8,0,6},b[10]={2,8,0,6,5,3,4,7,9,1},i,j,k;for(i=0;i<10;i++){//閫夋嫨娉曞a鐢卞皬鍒板ぇ鎺掑簭 for(k=i,j=k+1;j<10;j++)if(a[k]>a[j])k=j;if(k!=i)j=a...
绛旓細閬嶅巻鏁扮粍锛屾壘涓涓渶灏忕殑锛屾斁鍦╝[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; ...
绛旓細include "Stdio.h"void sa(int array[],int n){ int i,j,k,temp;for(i=0;i<10;i++){ k=i;for(j=i+1;j<n;j++)if(array[j]<array[k])k=j;temp=array[k];array[k]=array[i];array[i]=temp;} } int main(){ void sa(int array[],int n);int array[10],i;printf...
绛旓細i]; Data[i]=Data[j]; Data[j]=temp; } } } //閫夋嫨鎺掑簭缁撴潫 for(i=0;i<N;i++) { printf("鎺掑簭鍚庣%d涓暟涓:%d\n",i+1,Data[i]); }}甯屾湜瀵逛綘鏈夊府鍔┿
绛旓細{ // n 涓鏁扮粍鍏冪礌涓暟 int i,j,k,temp; // i 涓哄熀鍑嗕綅缃,j 涓哄綋鍓嶈鎵弿鍏冪礌浣嶇疆,k 鐢ㄤ簬...缂栧啓绋嬪簭 姹備袱鏁存暟鍜 閫夋嫨娉曟槸浠涔? 閫夋嫨娉曞10涓暣鏁版帓搴 閫夋嫨鎺掑簭娉曚妇渚 绠鍗曠殑閫夋嫨娉曟帓搴 ...鑻︾瓑3灏忔椂: 鏈変汉鐢ㄩ鐗屾暣鎴戣鎬庝箞鍔,鍙互璁╀竴涓汉鍙樻垚鍙︿竴涓汉鏉... 鍥炵瓟 鑻︾瓑5灏忔椂: win10瀛...
绛旓細include<stdio.h>int main(){int a[15];int i,j,t,k;for ( i = 0; i < 15; i++ ) scanf("%d",&a[i]); /*杈撳叆15涓暟*/for ( i = 0; i<14; i++ ){ k = i; for ( j = i + 1; j < 15; j++) if ( a[k] > a[j] ) k = j;if (k != i...
绛旓細include<stdio.h>#include<stdlib.h>void swap(int*a,int*b){int temp; temp=*a; *a=*b; *b=temp;}void select_sort(int a[],int n){int i,j,min,m; for(i=0;i<n-1;i++) {min=i;//鏌ユ壘鏈灏忓 for(j=i+1;j<n;j++) if(a[min]>a[j])min=j; ...
绛旓細min]=temp;} \x0d\x0aprintf("\n浠庡ぇ鍒板皬鎺掑垪鏄:\n"); //杈撳嚭瀛楃\x0d\x0afor(i=10;i>=1;i--) //寰幆杈撳嚭鎸夊ぇ灏忔帓鍒楃殑鏁版嵁\x0d\x0aprintf("%5d",a[i]);\x0d\x0aprintf("\n");//姣忚緭鍑轰竴涓暟鎹崲琛孿x0d\x0a} ...
绛旓細include<stdio.h> define SIZE 10 main(){ int a[SIZE]={3,8,7,6,5,0,1,2,9,4};int max,pos;int i,j;printf("鏁扮粍涓師瀛樻斁鏁版嵁鏄:\n");for(i=0;i<SIZE;i++)printf("%3d",a[i]);for(i=0;i<SIZE-1;i++){ max=a[i];pos=i;for(j=i+1;j<SIZE;j++)if(a[j]...
