using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
namespace 堆排序_顺序存储
{
class Program
{
static void Main(string[] args)
{
int[] data = {50,10,90,30,70,40,80,60,20 };
stackSort(data);
foreach (var item in data) Console.Write(item + " ");
Console.WriteLine();
Console.ReadKey();
}
public static void stackSort(int[] data)
{
for(int i = data.Length / 2; i >= 1; i--)
{
int maxNodeNumber = i;//默认最大子节点(非叶子节点)编号
int tempI = i;//临时变量是用来暂时存储当前子树最大编号?
while (true)
{
int leftChildNumber = tempI * 2;
int rightChildNumber = leftChildNumber + 1;
if (leftChildNumber < data.Length && data[leftChildNumber - 1] > data[maxNodeNumber - 1])
{
maxNodeNumber = leftChildNumber;
}
if (rightChildNumber < data.Length && data[rightChildNumber - 1] > data[maxNodeNumber - 1])
{
maxNodeNumber = rightChildNumber;
}
if (maxNodeNumber != tempI)//交换
{
int temp = 0;
temp = data[tempI - 1];
data[tempI - 1] = data[maxNodeNumber - 1];
data[maxNodeNumber - 1] = temp;
tempI = maxNodeNumber;//让tempI等于交换后的最大排序号方便和下一个分树中的孩子比较大小。
}else
{
break;
}
}
//经过上面的变换是把二叉树变成了大顶堆
}
}
}
}
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
namespace 堆排序_顺序存储
{
class Program
{
static void Main(string[] args)
{
int[] data = {50,10,90,30,70,40,80,60,20 };
stackSort(data);
foreach (var item in data) Console.Write(item + " ");
Console.WriteLine();
Console.ReadKey();
}
public static void stackSort(int[] data)
{
for(int i = data.Length / 2; i >= 1; i--)
{
int maxNodeNumber = i;//默认最大子节点(非叶子节点)编号
int tempI = i;//临时变量是用来暂时存储当前子树最大编号?
while (true)
{
int leftChildNumber = tempI * 2;
int rightChildNumber = leftChildNumber + 1;
if (leftChildNumber < data.Length && data[leftChildNumber - 1] > data[maxNodeNumber - 1])
{
maxNodeNumber = leftChildNumber;
}
if (rightChildNumber < data.Length && data[rightChildNumber - 1] > data[maxNodeNumber - 1])
{
maxNodeNumber = rightChildNumber;
}
if (maxNodeNumber != tempI)//交换
{
int temp = 0;
temp = data[tempI - 1];
data[tempI - 1] = data[maxNodeNumber - 1];
data[maxNodeNumber - 1] = temp;
tempI = maxNodeNumber;//让tempI等于交换后的最大排序号方便和下一个分树中的孩子比较大小。
}else
{
break;
}
}
//经过上面的变换是把二叉树变成了大顶堆
}
}
}
}