tanjuan918的博客

#include <stdio.h> #include <stdlib.h> void show(int a[],int n); void BinInsertSort(int a[], int n) { int key; int mid, low, high; for (int i = 1; i < n; i++) { key = a[i]; low = 0; high = i - 1; while (low <= high) { mid

#include <stdio.h> #include <stdlib.h> void show(int a[], int n); void Insection_Sort(int a[], int n) { int i, j; int key; for ( i = 1; i < n; i++)//第一个位置已经排好序，从第2个位置开始取数进行插入 { key = a[i]; for ( j = i - 1; j >= 0; j--)//i之前是所有已经排好