堆排序

#include <cstdio>
#include <time.h>
#include <stdlib.h>


template<typename A>
void Sort(A * array, int max_node,bool re)
{
if(re)
{
SortBig2Small(array , max_node);
}
else
{
SortSmall2Big(array , max_node);
}
}


template<typename A>
void SortBig2Small(A * array, int max_node)
{
for(int i = max_node; i>= 1  ; --i)
_SortBig2Small(array, i, max_node);


for(int i = 1; i <= max_node ; ++i)
{
Swap(array[0], array[max_node - i]);
_SortBig2Small(array, 1, max_node - i);
}
}


template<typename A>
void SortSmall2Big(A * array, int max_node)
{
for(int i = max_node; i>= 1  ; --i)
_SortSmall2Big(array, i, max_node);


for(int i = 1; i <= max_node ; ++i)
{
Swap(array[0], array[max_node - i]);
_SortSmall2Big(array, 1, max_node - i);
}
}


template<typename A>
void _SortSmall2Big(A * array, int node_index, int max_node)
{
if(node_index < 1)
return;
int child1 = node_index << 1, child2 = (node_index << 1) + 1;
int largest = node_index;
if(child1 <= max_node && array[largest - 1] < array[child1 - 1])
{
largest = child1;
}
if(child2 <= max_node && array[largest - 1] < array[child2 - 1])
{
largest = child2;
}
if(largest != node_index)
{
Swap(array[node_index - 1], array[largest - 1]);
_SortSmall2Big(array, largest, max_node);
}
}


template<typename A>
void _SortBig2Small(A * array, int node_index, int max_node)
{
if(node_index < 1)
return;
int child1 = node_index << 1, child2 = (node_index << 1) + 1;
int largest = node_index;
if(child1 <= max_node && array[largest - 1] > array[child1 - 1])
{
largest = child1;
}
if(child2 <= max_node && array[largest - 1] > array[child2 - 1])
{
largest = child2;
}
if(largest != node_index)
{
Swap(array[node_index - 1], array[largest - 1]);
_SortBig2Small(array, largest, max_node);
}
}


template<typename A>
void Swap(A& a, A& b)
{
static A c;
c = a;
a = b;
b = c;
}


template<typename A>
void Print(A * array, int len)
{
for(int i = 0; i < len ; ++i)
{
if(i == 0)
{
printf("%d", array[i]);
}
else
{
printf(" %d", array[i]);
}
}
printf("\n");
}


int main()
{
srand((unsigned int)time(NULL));
int a[50];
int l;
l = rand()%5 + 5;
for(int i = 0; i < l ; ++i)
a[i] = rand()%50;
Print(a, l);
Sort(a, l, false);
Print(a, l);
getchar();
return 0;
}