排序技术------交换排序

 起泡排序（Bubble_Sort)

        最简单的交换排序算法

起泡排序c++实现

#include<iostream>
#include<cstdio>
using namespace std;
const int MaxSize = 100;
void Bubble_Sort(int[],int);
int main()
{
    int array[MaxSize];
    int number =0 ;
    cin>>number;
    for(int i = 0;i < number;i++)
    {
        cin>>array[i];
    }
    Bubble_Sort(array,number);
    for(int i = 0;i < number;i++)
    {
        cout<<array[i]<<" ";
    }
    return 0;
}
void Bubble_Sort(int array[],int number)
{
    int exchange = number - 1,i,bound ;//exchange存放最后交换元素的位置，exchange之后的元素都已经有序。
    while(exchange != 0)//每次至少将一个最大的记录放到数组末尾
    {
        bound = exchange;//bound存放这一趟的边界
        exchange = 0;
        for(int j = 0;j < bound;j++)
        {
            if(array[j] >array[j+1])
            {
                array[j] = array[j] ^array[j+1];
                array[j+1] = array[j] ^array[j+1];
                array[j] = array[j] ^array[j+1];
                exchange = j;
            }
        }
    }
}