摘要：/*******************************************算法一：插入排序算法伪代码：insert_sort(A): for j =0 and A[i]>key do A[i+1]=A[i] i void insert_sort(int *arr,int n){ if(n=0 && arr[i]>key){ arr[i+1]=arr[i]; i--; } arr[i+1]=key; }}int main(){ ... 阅读全文