手敲二元堆積，堆排序，優先隊列

 早上倉促敲出來的，演算法大多數是YY出來的，不是很地道。晚上回來參考點資料，來個地道的。

這個排序叫冒泡更形象。

#include <stdio.h><br />#include <string.h><br />const int MaxN = 10001;</p><p>class Heap<br />{<br />public:<br />Heap():cnt(0){}<br />int Top(){<br />return a[1];<br />}<br />int min(int _a, int _b){<br />return a[_a] < a[_b] ? _a : _b;<br />}<br />int max(int _a , int _b){<br />return a[_a] > a[_b] ? _a : _b;<br />}<br />void swap(int _a , int _b){<br />a[_a] ^= a[_b] ^= a[_a] ^= a[_b];<br />}<br />void Pop(){<br />a[1] = a[cnt --];<br />int now = 1;<br />while ((now << 1) < cnt){<br />int tmp = min(now << 1 , 1 + (now << 1));<br />swap(now , tmp);<br />now = tmp;<br />}<br />if ((now << 1) == cnt && a[cnt] < a[now]){<br />swap(now , cnt);<br />}<br />}<br />void Push(int _a){<br />a[++ cnt] = _a;<br />int now = cnt;<br />while (now > 3){<br />int p1 = now >> 1 , p2 = p1 & 1 ? p1 + 1 : p1 - 1;<br />int tmp = max(p1 , p2);<br />if (a[now] >= a[tmp]) return;<br />swap(now , tmp);<br />now = tmp;<br />}<br />if (now > 1 && a[now] > a[1]){<br />swap(now , 1);<br />}<br />}<br />bool empty(){<br />return cnt == 0;<br />}<br />private:<br />int a[MaxN] , cnt;<br />};</p><p>void __test()<br />{<br />int i , j , n , a;<br />Heap H;<br />scanf("%d" , &n);<br />for (i = 0;i < n;i ++){<br />scanf("%d" , &a);<br />H.Push(a);<br />}<br />while (!H.empty()){<br />a = H.Top();H.Pop();<br />printf("%d " , a);<br />}<br />puts("");<br />}<br />int main()<br />{<br />__test();<br />}<br />/*<br />11<br />4 2 44 5 77 2 8 9 6 5 31<br />*/