Sorting/Ints/heapSort.c File Reference

Optimized (and efficient) Heap Sort implementation. This implementation of Heap Sort is taken from:. More...


Functions

void sort (int arr[], unsigned int N)
 Use HeapSort to sort the array of N integer values.


Detailed Description

Optimized (and efficient) Heap Sort implementation. This implementation of Heap Sort is taken from:.

http://en.wikibooks.org/wiki/Algorithm_implementation/Sorting/Heapsort

It is one of the more efficient implementations available.

Author:
George Heineman
Date:
6/15/08

Function Documentation

void sort ( int  arr[],
unsigned int  N 
)

Use HeapSort to sort the array of N integer values.

Algorithm Development Kit 1.0