堆排序（C++实现）_s = new people[number]; cout << p0->number << endl-优快云博客

本文链接：https://blog.youkuaiyun.com/mycocoo/article/details/110825980

该博客展示了一个C++程序，用于对整数数组进行排序。程序使用自定义的排序算法，通过不断交换元素来达到排序目的。在每次迭代中，程序会检查并交换相邻的元素，直到数组完全有序。此外，程序还提供了输入数组长度和元素的功能，以及在排序过程中显示中间状态的选项。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

#include<iostream>
using namespace std;
#define MaxNumber 100
int *Number = new int[MaxNumber];
void sort(int data[], int length) {
	int num = 0;
	bool a = true;
	while (a) {
		a = false;
		for (int i = length-1; i >=1; i--)
		{	
			bool b = false;
			if (i % 2 == 0) {
				if (data[i] < data[i - 1]) {
					a = true;
					b = true;
					num = data[i];
					data[i] = data[i-1];
					data[i-1] = num;
				}
				if (data[i] > data[(i-2)/2]) {
					a = true;
					b = true;
					num = data[i];
					data[i] = data[(i - 2) / 2];
					data[(i - 2) / 2] = num;
				}

			}
			if (i % 2 == 1) {
				if (data[i] > data[i+1]&&i!=length-1) {
					a = true;
					b = true;
					num = data[i];
					data[i] = data[i + 1];
					data[i + 1] = num;

				}
				if (data[i] > data[(i - 1) / 2]) {
					a = true;
					b = true;
					num = data[i];
					data[i] = data[(i - 1) / 2];
					data[(i - 1) / 2] = num;

				}
			}
			if (b) {
				cout << "----------------------------" << endl;
				cout << "数组：";
				for (int j = 0; j < length; j++)
				{
					cout << Number[j] << " ";
				}
				cout << endl;
			}
		}

	}
}

int main() {
	cout << "输入数组的长度：";
	int length;
	cin >> length;
	cout << "输入数组：";
	for (int i = 0; i < length; i++)
	{
		cin >> Number[i];
	}
	cout << endl;
	cout << "----------------------------" << endl;
	cout << "          数据录入完毕      " << endl;
	cout << "----------------------------" << endl;
	cout << "初始数组：";
	for (int i = 0; i < length; i++)
	{
		cout << Number[i] << " ";
	}
	cout << endl;
	sort(Number, length);
	cout << "----------------------------" << endl;
	cout << "排序后二叉树：";
	for (int i = 0; i < length; i++)
	{
		cout << Number[i] << " ";
	}
	cout << endl;

	return 0;
}