Done in this way to be able to assemble various alternative sorting arrangements staticly, rather than requiring one to recompile an application as part of running a test suite. More...
Variables | |
| int | minSize = 6 |
| Problem size below which to use insertion sort. | |
Done in this way to be able to assemble various alternative sorting arrangements staticly, rather than requiring one to recompile an application as part of running a test suite.
In this regard, we traded off the low-overhead of having lots of very small functions that do very little with the benefit of writing easy Makefiles that select which minimum size to use at static linking time.
| int minSize = 6 |
Problem size below which to use insertion sort.
Algorithm Development Kit 1.0