编程题:用冒泡排序法将一维数组A[10]={1、2、4、3、6、5、7、8、9、10}进行排列。 C语言编程：定义一个未排序的一维数组int a[10]={5...
\u7528\u5192\u6ce1\u6392\u5e8f\u6cd5\u5c06\u6570\u7ec4a[10]={1,3,2,5,6,7,4,9,10,8}\u4e2d\u7684\u6570\u8fdb\u884c\u4ece\u5927\u5230\u5c0f\u8fdb\u884c\u6392\u5217\uff0c\u5e76\u8f93\u51fa\u6392\u597d\u7684\u6570\u7ec4a[10]#include
int main()
{
int a[10]={1,3,2,5,6,7,4,9,10,8},i,j,t ;
for(i=1;i<=9;i++)
for(j=0;j<9;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\n",a[i]);
return 0;
}
void selectSort(int a[], int n) {
int i, j, nMinIndex;
for (i = 0; i < n; i++) { //\u603b\u5171\u627en\u6b21
nMinIndex = i; //\u5148\u628a\u7b2c\u4e00\u4e2a\u5143\u7d20\u8bbe\u4e3a\u6700\u5c0f\u5143\u7d20
for (j = i + 1; j < n; j++)
if (a[j] < a[nMinIndex])
nMinIndex = j;
Swap(a[i], a[nMinIndex]); //\u7b2ci\u6b21\uff0c\u653e\u5230a[i]
}
}
int main(){
int iarr[] = {9,3,2,4,1,5,};
selectSort(iarr, sizeof(iarr)/sizeof(iarr[0])); //\u8c03\u7528\u5b8ciarr\u5c31\u6392\u5e8f\u597d\u4e86
return 0;
}
#include
using namespace std;/*\u6dfb\u52a0*/
void printdata(int *data,int n)
{ for(int i=1; i<=n; i++)
cout<<data[i]<<" ";
cout<<endl;
}
void Bubble_Sort (int *p,int n)
{
int exchange=1,i=0; /*i\u521d\u59cb\u5316*/
while(exchange)
{
exchange=0;
for(int j=1; j<n-i; j++)
{ if(p[j]>p[j+1])
{ int temp=p[j]; p[j]=p[j+1]; p[j+1]=temp;
}
exchange=1; /*\u4fee\u6539\u4f4d\u7f6e*/
}
i++; /*\u4fee\u6539\u4f4d\u7f6e*/
}
}
int main()
{
int n=10;
int a[]={7,8,9,1,14,-1,26,0,4,78};
cout<<"\u5192\u6ce1\u6392\u5e8f:"<<endl;
cout<<"\u672a\u6392\u5e8f\u7684\u6570\u4e3a:";
printdata(a,n-2);
Bubble_Sort (a,n-2);
cout<<"\u6392\u8fc7\u5e8f\u7684\u6570\u4e3a:";
printdata(a,n-2);
cout<<endl;
return 0;
}
\u8ddf\u8fd9\u4e2a\u5dee\u4e0d\u591a\uff0c\u4f60\u7a0d\u5fae\u6539\u4e0b\u5c31\u53ef\u4ee5\u4e86
#include "stdio.h"
void bubble_sort(int array[],int n)
{//冒泡法排序
int i,j,flag,temp;
for(i = 0; i < n-1; i++)
{
flag = 1;
for(j = 0; j < n-i-1; j++)
{
if(array[j] > array[j+1])
{
temp = array[j];
array[j] = array[j+1];
array[j+1] = temp;
flag = 0;
}
}
if(1 == flag)break;
}
}
void main()
{
int A[10]={1、2、4、3、6、5、7、8、9、10},i;
bubble_sort(a,10);
for(i = 0; i < 10; i++)
printf("%d ",a[i]);
printf("\n");
}
//此程序为从小到大排列
#include<iostream>
using namespace std;
int main()
{
int A[]={1,2,4,3,6,5,7,8,9,10};
int i,j,max;
for(i=0;i<=9;i++)
{
for(j=0;j<=i-1;j++)
if(A[i]<A[j])
{
int t=A[i];
A[i]=A[j];
A[j]=t;
}
max=A[j];
}
cout<<"排序后的数为\n";
for(i=0;i<=9;i++)
cout<<A[i]<<" ";
cout<<endl;
cout<<"几个数中最大的为： "<<A[j]<<" ";
cout<<endl;
system("pause");
return 0;
}
这是c++语言，我新加了求最大数的代码，其实很简单。有什么问题直接问我
绛旓細include <stdio.h>void bsort(int a[],int n)//鍐掓场{ int i,j,t; for (i=0;i<n;i++) for(j=i+1;j<n;j++) if(a[j]>a[i]) { t=a[j]; a[j]=a[i]; a[i]=t; } }int main(){ int i,n=12,a[]={96,35,12,58,78,90,587...
绛旓細/ 浠ヤ笅鏄畬鏁翠唬鐮侊紝浣犵湅鐪嬪惂 甯屾湜鑳藉府鍔╀綘 / include <stdio.h> void sort_shengxu(int * pArr, int len){ int i,j,t;for (i=0; i<len-1; ++i)//鏁翠綋姣旇緝len-1娆 { for (j=0; j<len-1-i; ++j)//鍐呴儴姣旇緝娆℃暟瓒婃潵瓒婂皯 { if (pArr[j] > pArr[j+1])// >琛ㄧず鍗囧簭 ...
绛旓細鏈鍚庝袱涓暟鏄笉鍙備笌姣旇緝鐨勩(6)渚濇绫绘帹锛屾瘡涓瓒熸瘮杈冩鏁板噺灏戜緷娆℃瘮涓婁竴瓒熷噺灏戜竴娆°傜畻娉曞垎鏋愶細(1)鐢辨鍙锛歂涓暟瀛楄鎺掑簭瀹屾垚锛屾诲叡杩涜N-1瓒熸帓搴忥紝姣廼瓒熺殑鎺掑簭娆℃暟涓(N-i)娆★紝鎵浠ュ彲浠ョ敤鍙岄噸寰幆璇彞锛屽灞傛帶鍒跺惊鐜灏戣稛锛屽唴灞傛帶鍒舵瘡涓瓒熺殑寰幆娆℃暟(2)鍐掓场鎺掑簭鐨勪紭鐐癸細姣忚繘琛屼竴瓒熸帓搴忥紝...
绛旓細include <stdio.h> void bubble_sort(int *arr,int n){ int i,j;int tmp;for(i = 0;i < n;i++){ for(j = 0;j < n - i - 1;j++){ if(arr[j] > arr[j+1]){ tmp = arr[j];arr[j] = arr[j+1];arr[j + 1] = tmp;} } } } void print_array(int *arr,...
绛旓細include <stdio.h>#include <conio.h>#define ARR_LEN 255 /*鏁扮粍闀垮害涓婇檺*/#define elemType int /*鍏冪礌绫诲瀷*//* 鍐掓场鎺掑簭 *//* 1. 浠庡綋鍓嶅厓绱犺捣锛屽悜鍚庝緷娆℃瘮杈冩瘡涓瀵圭浉閭诲厓绱狅紝鑻ラ嗗簭鍒欎氦鎹 *//* 2. 瀵规墍鏈夊厓绱犲潎閲嶅浠ヤ笂姝ラ锛岀洿鑷虫渶鍚庝竴涓厓绱 *//* elemType arr[]: 鎺掑簭鐩爣鏁扮粍;...
绛旓細void main(){ recs A={2,5,3,4,6,10,9,8,7,1};int n=10, i;cout<<"鍙屽悜鍐掓场鎺掑簭"<<endl<<"鎺掑簭鍓:";for(i=0;i<n;i++)cout<<A[i]<<"";cout<<endl;cout<<" 鎺掑簭鍚: ";bibubble(A,n);for(i=0;i<n;i++)cout<<A[i]<<"";cout<<endl;} ...
绛旓細鎮ㄥソ锛岃繖鏍凤細杩欎釜浜嬪崌搴忔帓鍒 int one = 0;int two = 0;int[] array = { 96,35,12,58,78,90,587,21,0,-64,106,52};for (int i = 0; i < array.length - 1; i++) { for (int j = i; j < array.length - i - 1; j++) { one = array[j];two = array[j + 1...
绛旓細include "stdio.h"int main(void){ int s[10],temp;for(int i=0;i<10;i++)scanf("%d",&s[i]);//閫夋嫨鎺掑簭娉 for(i=0;i<10;i++){ for(int j=i;j<10;j++){ if(s[i]>s[j]){ temp=s[i];s[i]=s[j];s[j]=temp;} } } //鍐掓场鎺掑簭娉 for(i=0;i<10;i++){...
绛旓細涓.鍏充簬鎺掑簭,鍙互浣跨敤鍐掓场鐨勬柟寮忚繘琛.鍘熺悊鏄厛浠鏁扮粍鐨勭涓涓厓绱犱笌绗簩涓瘮杈,灏嗗ぇ鐨勪笌灏忕殑浜ゆ崲浣嶇疆,鍐嶅皢绗簩涓笌绗笁涓繘琛屾瘮杈,鎸夊悓鏍风殑瑙勫垯浜ゆ崲浣嶇疆,渚濇姣旇緝涓嬪幓.濡 2 1 4 5 绗竴娆℃瘮杈冨悗鎺掑垪涓 2 4 5 1,杩欐牱渚垮彲灏嗘渶灏忕殑鏁版嫋鍒颁簡鏈鍚.浣嗚繕娌℃湁瀹.杩橀渶瑕佸啀浠庣涓鍏冪礌...
绛旓細鐢╯ort鍑芥暟锛屼緥濡 int a[10]; sort(a,a+10) 澶存枃浠 鈥渁lgorithm鈥濅笂闈负蹇帓 鍐掓场锛void main(){ int i,j,temp;int a[10];for(i=0;i<10;i++)scanf ("%d,",&a[i]);for(j=0;j<=9;j++){ for (i=0;i<10-j;i++)if (a[i]>a[i+1]){ temp=a[i];a[i]=a...
