折半插入排序在查找记录插入位置时，采用折半查找算法 折半查找比顺序查找快, 所以折半插入排序在查找上性能比直接插入排序好 -Binary insertion sort to find records insertion position, using a binary search binary search algorithm is faster than the sequential search, binary insertion sort on so look better pe