排序算法总结

#include <IOSTREAM>
using namespace std;
void Insert_Sort(int a[],int n);

int main(void)
{
    int a[] = {1,3,5,5,3,2,4};
    for (int i=0;i<sizeof(a)/sizeof(a[0]);i++)
    {
        cout << a[i] << endl;
    }

    Insert_Sort(a,sizeof(a)/sizeof(a[0]));
    cout << "afert sort:" << endl;

    for (i=0;i<sizeof(a)/sizeof(a[0]);i++)
    {
        cout << a[i] << endl;
    }
    
    return 0;
}

void Insert_Sort(int a[],int n)
{
    for(int i=1;i<n;i++)
    {
        int temp = a[i];
        for (int j=i;j>0;j--)
        {
            if(temp>a[j-1])
            {
                a[j] = temp;
                break;
            }
            else
            {
                a[j] = a[j-1];
            }


        }
    }
}