冒泡排序

一.由小到大

424,#include<iostream>

425.using namespace std;

426.int main()

427.{int a[10];
428.int i,j,k;
429.cout<<"输入十个数:"<<endl;
430.for(i=0;i<=10;i++) cin>>a[i];
431.cout<<endl;
432.for(j=0;j<9;j++)
433.for(i=0;i<9-j;i++)
434.if(a[i]>a[i+1])
435.{k=a[i];a[i]=a[i+1];a[i+1]=k;
436.}
437.cout<<"输出这十个数:"<<endl;
438.for(i=0;i<10;i++) cout<<a[i]<<" ";
439.cout<<endl;
440.return 0;

441.}

二.由大到小

442.#include<iostream>
443.using namespace std;
445.int main()
446.{
447.int a[10];
448.int i,j,k;
449.cout<<"输入十个数:"<<endl;
450.for(i=0;i<=10;i++) cin>>a[i];
451.cout<<endl;
452.for(j=0;j<9;j++)
453.for(i=0;i<9-j;i++)
454.if(a[i]<a[i+1])
455.{k=a[i];a[i]=a[i+1];a[i+1]=k;
456.}
457.cout<<"输出这十个数:"<<endl;
458.for(i=0;i<10;i++) cout<<a[i]<<" ";
459.cout<<endl;
460.return 0;
461.}