Build up a file of strings of fixed-size to use as input for the various sorting algorithms. More...
#include <stdlib.h>
Go to the source code of this file.
Defines | |
| #define | ELEMENT_SIZE 26 |
| fixed size of strings. | |
Functions | |
| void | sortFile (FILE *strings, int numElements, int size, int(*fileCompString)(const long pos, const char *a2)) |
| Interface to sort the file of strings. | |
Build up a file of strings of fixed-size to use as input for the various sorting algorithms.
This code shows the overhead implicit in secondary storage.
| #define ELEMENT_SIZE 26 |
fixed size of strings.
| void sortFile | ( | FILE * | strings, | |
| int | numElements, | |||
| int | size, | |||
| int(*)(const long pos, const char *a2) | fileCompString | |||
| ) |
Interface to sort the file of strings.
| strings | File of strings on disk | |
| numElements | Number of strings in this file. | |
| size | The fixed size of the strings in the file. | |
| fileCompString | Special comparator function that compares string in memory (a2) against location on disk (long pos). |
Algorithm Development Kit 1.0