/*
        Distribution Counting, BucketSort, LinearSort
        this sort algorithm is the FASTEST one and it is LINEAR
        
        Copyright (c) 1998 by Michael Neumann (neumann@s-direktnet.de)
        01.08.1998

	for Watcom C++ V.11.0 // tested
*/

# ifndef __BUCKET_HEADER__
# define __BUCKET_HEADER__

// sort is the array where the data is, and will be after sorting
// buffer is a help-array which must be the same size like the sort-array
// anz is the number of elements in the array
// The array must consist of 8-byte entries, where the first dword is the key,
// and the second dword is a value
extern "C" void bucketsort(void *sort, void* buffer, int anz);


# endif