February 1992
Volume 10 Number 2
ALGORITHMS
Nearest Neighbor Algorithm For Color Matching
By Geoffrey Probert
Make the nearest neighbor
algorithm more useful by extending it to more than two
dimensions.
Hashing From Good To Perfect
By Ron Burk
With these extensions, hashing
becomes a suitable solution for a wider range of problems.
Data Compression Using Huffman Coding
By Dwayne Phillips
Use this compression scheme to
save disk space and communications time.
OTHER FEATURES
Arithmetic In Factorial-Base
By Frederick Hegeman
This unusual representation scheme
can represent all rational numbers exactly.
Wildcard Subdirectory Searches
By Toby Popenfoose
This library routine greatly
simplifies file operations performed from within an
application.
Curve Fitting By Chebyshef And Other Methods
By Dr Timothy Prince
This advanced technique tends to
give a better fit and is often easier to manipulate.
COLUMNS
Standard C
PJ Plauger
Doctor C's Pointers
Rex Jaeschke
Questions & Answers
Ken Pugh
On The Networks
Sydney Weinstein