* Tim Hutzler writes to Majed Alharbi, on Monday December 30 1996
   at 19:03:
 TH> CRC is very simple to implement. You can simply add up all the bytes
     ^^^                                      ^^^^^^^^^^^^^^^^^^^^^^^^^^^
 TH> that are in a file, and append that value to the file. When recalling
 TH> the file, you simply do it again, but *comapre* the sum with the
 TH> stored value. It better match. If you use a 32-bit CRC, the chances
 TH> of an error getting by is small.
Checksum you mean, surely? :-)
CRCs are specifically designed to catch single bit errors, so they are 
particularly useful in communications. What they are *not* so good for is as 
a general hashing algorithm. Unfortunately many programmers seem to think a 
CRC32 is the best (easiest maybe?) way to generate a hash table.
Cheers.
---
---------------