Christopher Friedt bd83df1552 libc: minimal: add qsort to the minimal libc ... This change implements qsort() for the minimal libc via Heapsort. Heapsort time complexity is O(n log(n)) in the best, average, and worst cases. It is O(1) in space complexity (i.e. sorts in-place) and is iterative rather than recursive. Heapsort is not stable (i.e. does not preserve order of identical elements). On cortex-m0, this implementation occupies ~240 bytes. Fixes #28896 Signed-off-by: Christopher Friedt <chrisfriedt@gmail.com>		2021-11-10 07:00:36 -05:00
..
abort.c
atoi.c	lib: add default labels and comments to switch statements	2021-06-04 16:22:23 -05:00
bsearch.c
exit.c
malloc.c	libc/minimal: locate the memory pool for malloc() to .bss	2021-09-10 10:59:25 -04:00
qsort.c	libc: minimal: add qsort to the minimal libc	2021-11-10 07:00:36 -05:00
rand.c	libc: minimal: Add rand() and srand()	2021-07-20 13:32:36 -04:00
strtol.c	license: add missing SPDX headers	2021-02-11 08:05:16 -05:00
strtoul.c	license: add missing SPDX headers	2021-02-11 08:05:16 -05:00