比较经典的C++插入排序

#include 
void swap(int *a , int *b)
{
    int M;
    M = *a;
    *a = *b;
    * b = M;
}
void sort(int *a,int n)
{
    for (int i = 0; i < n; ++i) {
        int Minindex = i;
        for (int j = i+1; j *(a+j)? j: Minindex;
        }
        swap(a+i,a+Minindex);
    }
}

int main()
{
    int a[] ={7,1,4,3,5,6,3,4,2,6,8,5,2,9};
    int n = sizeof(a)/ sizeof(a[0]);
    for (int i = 0; i < n; ++i) {
        std::cout<

C++选择排序,基本最优模式.