#include <DynaSort.h>
|
| static void | mergeSort (T **array, int length, int low, int high, IDynaComparator< T *> &comparator) |
| | Sort an array of objects, typically those allocated with "new". More...
|
| |
| static void | mergeSort (T **array, int length, IDynaComparator< T *> &comparator) |
| |
| static void | mergeSort (DynaList< T > *list, int low, int high, IDynaComparator< T *> &comparator) |
| | Sort the objects in a DynaList (vector) More...
|
| |
| static void | mergeSort (DynaList< T > *list, IDynaComparator< T *> &comparator) |
| |
◆ _mergeSort()
◆ _swap()
◆ mergeSort() [1/4]
Sort an array of objects, typically those allocated with "new".
- Parameters
-
| array | of pointers to objects |
| length | number of pointers in the array |
| low | starting index (0-based) |
| high | ending index (must be less than length) |
| comparator | reference to the comparator function |
◆ mergeSort() [2/4]
◆ mergeSort() [3/4]
Sort the objects in a DynaList (vector)
- Parameters
-
| list | pointer to the DynaList object |
| low | starting index (0-based) |
| high | ending index (must be less than length) |
| comparator | reference to the comparator function |
◆ mergeSort() [4/4]
The documentation for this class was generated from the following files: