IOCCC image by Matt Zucker

The International Obfuscated C Code Contest

1995/esde - Interesting algorithm

Author:

To build:

    make all

To use:

    ./esde data-file word

where data-file contains lines of < 255 chars in length.

Try:

    ./try.sh

Judges’ remarks:

When reading the source be careful to distinguish between variable names and library functions.

If you still don’t know what it does, try https://en.wikipedia.org/wiki/Soundex.

Author’s remarks:

what this program does

This program searches in the file words which have the same Soundex code of the given word, and print out lines with those words.

The Soundex code is used to find similar sounding words.

Soundex code begins with the first letter of the word followed by a three-digit code. This is the algorithm:

  1. Every letter in the word beyond the first letter is replaced by a digit.
  2. Replace all pairs of the same code by single code (e.g. R011235 -> R01235).
  3. Remove all zeroes (e.g. R01235 -> R1235).
  4. If length of code is > 4, get only first 4 characters (e.g. R1235 -> R123).
  5. If length of code is < 4, add zeros (e.g. T12 -> T120).

These are the codes:

    0  =  A, E, H, I, O, U, W, Y
    1  =  B, P, F, V
    2  =  C, S, G, J, K, Q, X, Z
    3  =  D, T
    4  =  L
    5  =  M, N
    6  =  R

information about an info file:

An info file should be a text file consisting of lines of text (max. 256 bytes in each line).

Inventory for 1995/esde

Primary files

Secondary files


Jump to: top