Build up a pointer-based array of Doubles to use as a basis for testing the various sorting algorithms. More...
Go to the source code of this file.
Defines | |
| #define | ELEMENT_SIZE sizeof(double) |
| Defines the base size of each element as a MACRO. | |
Functions | |
| void | sortPointers (double **values, int n, int(*doubleComp)(double *a1, double *a2)) |
| Interface to sort the pointer-based information found in values. | |
Variables | |
| double ** | values |
| where input is located in memory. | |
Build up a pointer-based array of Doubles to use as a basis for testing the various sorting algorithms.
| #define ELEMENT_SIZE sizeof(double) |
Defines the base size of each element as a MACRO.
| void sortPointers | ( | double ** | values, | |
| int | n, | |||
| int(*)(double *a1, double *a2) | doubleComp | |||
| ) |
Interface to sort the pointer-based information found in values.
| values | Array of strings in memory. | |
| n | number of strings in this array. | |
| doubleComp | function to compare two double values. |
| double** values |
where input is located in memory.
Algorithm Development Kit 1.0