插入排序

#include <iostream>using namespace std;typedef int T;void sort(T a[], int n){T temp;int pos; for (int i=1; i<n; i++){temp = a[i];for (pos=i; pos>0 && a[pos-1]>temp; pos--)a[pos] = a[pos-1];//从右向左找a[pos] = temp;}} int main(){T a[5] = {1, 4, 6, 2, 9};sort(a, 5);for (int i=0; i<5; i++)cout << a[i] << ' ';return 0;}