数据结构与算法学习（3）

数据结构与算法学习（3）

一.堆排序

void HeapInsert(vector<int>& arr, int index) {
	while (arr[index] > arr[(index - 1) / 2])
	{
		Swap(arr, index, (index - 1) / 2);
		index = (index - 1) / 2;
	}
}
void Heapify(vector<int>& arr, int index, int size) {
	int left = 2 * index + 1;
	while (left < size)
	{
		int t = (left + 1 < size && arr[left + 1] > arr[left]) ? left + 1 : left;
		t = arr[index] > arr[t] ? index : t;
		if (t == index)
			break;
		Swap(arr, index, t);
		index = t;
		left = 2 * index + 1;
	}
}

void Sort01(vector<int>& arr) {
	//for (int i = 0; i < arr.size(); i++)
	//	HeapInsert(arr, i);
	for (int i = arr.size() - 1; i >= 0; i--)
		Heapify(arr, i, arr.size());
	int heapSize = arr.size();
	while (heapSize > 0)
	{
		Swap(arr, 0, --heapSize);
		Heapify(arr, 0, heapSize);
	}

}

1.对几乎有序的数组排序

void Test01(vector<int>& arr,int k) {
	priority_queue<int, vector<int>, greater<int>> que;
	int i = 0;
	for (; i <= k; i++)
		que.push(arr[i]);
	int j = 0;
	for (; i < arr.size(); i++, j++) {
		que.push(arr[i]);
		arr[j] = que.top();
		que.pop();
	}
	while (!que.empty()) {
		arr[j] = que.top();
		que.pop();
	}
}

二.桶排序

1.计数排序

void Sort03(vector<int>& arr, int left, int right) {
	vector<int> helper(right - left + 1, 0);
	int size = arr.size();
	for (int i = 0; i < size; i++)
		helper[arr[i]]++;
	int index = 0;
	for (int i = 0; i < helper.size(); i++)
	{
		if (helper[i] == 0)continue;
		while (helper[i] > 0)
		{
			arr[index++] = i;
			helper[i]--;
		}
	}
}

2.基数排序

int GetBits(vector<int>& arr) {
	int maxNum = INT_MIN;
	for (auto num : arr)
		maxNum = max(maxNum, num);
	int res = 0;
	while (maxNum > 0)
	{
		maxNum /= 10;
		res++;
	}
	return res;
}
int GetDigit(int num, int index) {
	return (num / (int)pow(10, index - 1)) % 10;
}
void Sort02(vector<int>& arr) {
	vector<int> helper(arr.size(), 0);
	int bits = GetBits(arr);
	int size = arr.size();
	for (int i = 1; i <= bits; i++)
	{
		vector<int> counts(10, 0);
		for (int j = 0; j < size; j++)
			counts[GetDigit(arr[j], i)]++;
		for (int j = 1; j < counts.size(); j++)
			counts[j] += counts[j - 1];
		for (int j = size - 1; j >= 0; j--) {
			int t = GetDigit(arr[j], i);
			helper[counts[t] - 1] = arr[j];
			counts[t]--;
		}
		for (int j = 0; j < size; j++)
			arr[j] = helper[j];
	}
}