AceSorting
0.2
Sorting algorithms for Arduino (Bubble Sort, Insertion Sort, Shell Sort, Comb Sort, Quick Sort)
|
#include "swap.h"
Go to the source code of this file.
Functions | |
template<typename T > | |
void | ace_sorting::shellSortClassic (T data[], uint16_t n) |
Shell sort with gap size reduced by factor of 2 each iteration. More... | |
template<typename T > | |
void | ace_sorting::shellSortKnuth (T data[], uint16_t n) |
Shell sort using gap size from Knuth. More... | |
template<typename T > | |
void | ace_sorting::shellSortTokuda (T data[], const uint16_t n) |
Shell sort using gap sizes empirically determined by Tokuda. More... | |
Shell sort with different gap algorithms.
Definition in file shellSort.h.
void ace_sorting::shellSortClassic | ( | T | data[], |
uint16_t | n | ||
) |
Shell sort with gap size reduced by factor of 2 each iteration.
Average complexity: Between O(n^1.3) to O(n^1.5) See https://en.wikipedia.org/wiki/Shellsort
T | type of data to sort |
Definition at line 46 of file shellSort.h.
void ace_sorting::shellSortKnuth | ( | T | data[], |
uint16_t | n | ||
) |
Shell sort using gap size from Knuth.
Average complexity: Between O(n^1.3) to O(n^1.5)
T | type of data to sort |
Definition at line 78 of file shellSort.h.
void ace_sorting::shellSortTokuda | ( | T | data[], |
const uint16_t | n | ||
) |
Shell sort using gap sizes empirically determined by Tokuda.
See https://en.wikipedia.org/wiki/Shellsort and https://oeis.org/A108870. Average complexity: Between O(n^1.3) to O(n^1.5)
T | type of data to sort |
Definition at line 119 of file shellSort.h.