摘要： 2.1 Insertion sort Insertion Sort#include <iostream>using namespace std;int main(){ int a[]={5,2,4,6,1,3}; int n=5; for (int j=1;j<=n;++j) { int key=a[j]; int i=j-1; while (( i >= 0)&& (a[i]>key)) { a[i+1]=a[i]; --i; } a... 阅读全文