using?System;
using?System.ComponentModel.DataAnnotations;

namespace?堆排序
{
????class?Program
????{

????????static?void?Main（）
????????{
????????????int[]?tree?=?{?18?54??14??45??96??27?80??22??81??31
???????????????????????????0???63??49??5???59??27??28??75??68??52
????????????????????????????52??66??5???98??44??19??22??16??88??34
???????????????????????????59??81??12??85??49??54??84??13??46??83
????????????????????????????88??1???70??32??45??32??38??41??4??50};
????????????heapsort（tree）;
????????????Console.WriteLine（“排序后的數(shù)列：“）;
????????????foreach?（int?n?in?tree）
?????????????Console.WriteLine（n?+?““）;?
????????}
????????static?void?heapify（int[]?tree?int?i?int?large）
????????{
????????????int?c1?=?（2?*?i）?+?1;
????????????int?c2?=?（2?*?i）?+?2;
????????????int?max?=?i;
????????????if?（c1??tree[max]）
????????????{
????????????????max?=?c1;
????????????}
????????????if?（c2?