#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;
}