/* Configuration */

static struct conv {
        int ch;
        const char *replace;
} tab[] = {
        { ’<’,        "&lt;" },
        { ’>’,        "&gt;" },
        { ’ ’,        "&nbsp;" },
        { ’&’,        "&amp;" },
        { ’\"’,        "&quot;" },
        { 0,        0 }
};

static const char *tabstr = "&nbsp;";
static int tabspaces = 8;
static int usebreaks = 0;

/* End of configuration */

static int eol(int c, FILE *stream)
{
        if (c == ’\n’)
                return 1;
        if (c == ’\r’) {
                if ((c = getc(stream)) != ’\n’)
                        ungetc(c, stream);
                return 1;
        }
        return 0;
}

static const char *getstr(int c)
{
        struct conv *t = tab;

        while (t->replace) {
                if (c == t->ch)
                        return t->replace;
                t++;
        }
        return 0;
}

static void tabify(FILE *dest, int n, const char *s)
{
        while (n–)
                fputs(s, dest);
}

static int htmlify(FILE *dest, FILE *src)
{
        int c;

        while ((c = getc(src)) != EOF) {
                const char *s;

                if (usebreaks && eol(c, src)) {
                        fputs("<br />", dest);
                        continue;
                }
                if (c == ’\t’) {
                        tabify(dest, tabspaces, tabstr);
                        continue;
                }
                s = getstr(c);
                if (s)
                        fputs(s, dest);
                else
                        putc(c, dest);
        }
        return ferror(dest);
}

static const char *progname = "htmlify";

int main(int argc, char *argv[])
{
        FILE *stream;
        int retval;

        if (argv[0] && argv[0][0] != ”)
                progname = argv[0];
        if (argc != 2) {
                fprintf(stderr, "Usage: %s c-source-file\n", progname);
                return EXIT_FAILURE;
        }
        stream = fopen(argv[1], "r");
        if (!stream) {
                fprintf(stderr, "%s: %s: %s\n", progname, argv[1],
                        strerror(errno));
                return EXIT_FAILURE;
        }
        retval = htmlify(stdout, stream) ? EXIT_FAILURE : 0;
        fclose(stream);
        return retval;
}

Below is my implementation of insertion sort in C. It’s not quite as feature-full as the OP’s, but at least it will compile on any standard-compliant implementation of C.

#include

#define NELEMS(a) (sizeof (a) / sizeof ((a)[0]))

static void sort(int *arr, size_t nmemb)
{
        size_t i;

        for (i = 1; i key)
                        arr[j + 1] = arr[j];
                arr[j + 1] = key;
        }
}

static void print(int *arr, size_t nmemb)
{
        while (–nmemb)
                printf(“%d “, *arr++);
        printf(“%d\n”, *arr);
}

int main(void)
{
        int arr[] = { 32, -12, -3, 431, -41, -14, -23, 322, 31, -144, 10 };

        sort(arr, NELEMS(arr));
        print(arr, NELEMS(arr));
        return 0;
}