millert
3791eca4cb
The BSD qsort() performs tail recursion elimination on the second
side of the array being partitioned to save on stack space. Greater savings can be gained by choosing recursion for the smaller side of the partition and eliminating recursion for the larger side. This also results in a small but measurable performance gain. OK otto@ schwarze@ |
7 years ago | |
---|---|---|
src | The BSD qsort() performs tail recursion elimination on the second | 7 years ago |