排序算法-折半插入排序

排序算法-折半插入排序

关键点

1. 理解二分查找的具体过程
2. 理解要插入位置后面的数据移动过程

/*C++版本*/
#include <iostream>
#include <vector>
using namespace std;

//直接插入+二分查找
vector<int>  halfInsert(vector<int> arr) {
	//遍历 i
	int high, low, mid, temp;
	for (int i = 1; i < arr.size(); i++) {
		high = i-1;
		low = 0;
		mid = 0;
		//查找已经有序的数组
		while (low <= high) {
			//需要一个哨兵位置用来存放要插入的值
			temp = arr[i];
			//在左半侧
			mid = (high + low) / 2;
			if (arr[i] < arr[mid]) 
				high = mid - 1;
			//在右半侧
			else low = mid + 1;
		}
		//移动要插入位置后面的值
		for (int j = i-1; j >= high+1; j--) {
			arr[j + 1] = arr[j];
		}
		arr[high+1] = temp;
	}
	return arr;
}

void test() {

	vector<int> arr= { 5, 2, 11, 56, 1, 33, 22, 15, 24, 30 };
	auto ret = halfInsert(arr);
	for (auto it = ret.begin(); it != ret.end(); it++) {
		cout << *it << " ";
	}
}


int main() {

	test();
	return 0;
}