The AWK Programming Language书里
7.1节的heapsort段落
7.1节的heapsort段落
#/bin/bash
echo | awk '
{ A[NR] = $0 }
END { hsort(A, NR)
for (i = 1; i <= NR; i++)
{ print A[i] }
}
function hsort(A, n, i) {
for (i = int(n/2); i >= 1; i--)
{ heapify(A, i, n) }
for (i = n; i > 1; i--) {
{ swap(A, 1, i) }
{ heapify(A, 1, i-1) }
}
}
function heapify(A, left, right, p, c) {
for (p = left; (c = 2*p) <= right; p = c) {
if (c < right && A[c+1] > A[c])
{ c++ }
if (A[p] < A[c])
{ swap(A, c, p) }
}
}
function swap(A, i, j, t) {
t = A[i]; A[i] = A[j]; A[j] = t
}' <<EOF
76
12
5
96
30
EOF