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
..
devmem_load	shell: add devmem load command	2021-08-13 10:13:36 -04:00
fs	cmake: increase minimal required version to 3.20.0	2021-08-20 09:47:34 +02:00
shell_module	libc: minimal: add qsort to the minimal libc	2021-11-10 07:00:36 -05:00
shell.rst