用C++实现冒泡排序,选择排序

冒泡排序很简单，就是每次循环将最大的数放到最后，循环n次就行了

选择排序每次循环记录最小的换到前面

#include <iostream>
using namespace std;

typedef int ElemType;

void mporder(ElemType  data[],int len)
{
    ElemType temp=0,count=0;
    while (count < len)
    {
        for (int ii = 0; ii < len-1; ii++)
        {
            if (data[ii] > data[ii + 1])
            {
                temp = data[ii];
                data[ii] = data[ii + 1];
                data[ii + 1] = temp;
            }
            temp = 0;
        }
        count++;
    }
}

void mpinorder(ElemType  data[], int len)
{
    ElemType temp = 0, count = 0;
    while (count < len)
    {
        for (int ii = 0; ii < len - 1; ii++)
        {
            if (data[ii] < data[ii + 1])
            {
                temp = data[ii];
                data[ii] = data[ii + 1];
                data[ii + 1] = temp;
            }
            temp = 0;
        }
        count++;
    }
}

void chorder(ElemType data[], int len)
{
    ElemType temp,min;
    for (int i = 0; i < len; i++)
    {
        min = i;
        for (int j = i+1; j < len; j++)
        {
            if (data[min] > data[j])
                min = j;
        }
        temp=data[i] ;
        data[i] = data[min];
        data[min] = temp;
    }
}

int main()
{
    ElemType data[] = { 4,8,56,7,24,66,94,20,30,41,1,5,99 };
    mporder(data, 13);
    cout<< "冒泡排序由小到大：";
    for (int i = 0; i < 13; i++)
    {
        cout <<data[i] << "\t";
    }
    cout << endl<<endl;
    mpinorder(data, 13);
    cout << "冒泡排序由大到小：";
    for (int i = 0; i < 13; i++)
    {
        cout << data[i] << "\t";
    }
    cout << endl<<endl;

    chorder(data, 13);
    cout<< "选择排序由小到大：";
    for (int i = 0; i < 13; i++)
    {
        cout <<data[i] << "\t";
    }
    cout << endl<<endl;
}