From: Kuan-Wei Chiu Date: Tue, 16 Jan 2024 02:16:57 +0000 (+0800) Subject: stdlib: Verify heapsort for two-element cases X-Git-Tag: glibc-2.39~50 X-Git-Url: http://git.ipfire.org/gitweb.cgi?a=commitdiff_plain;h=1bb28b7b4f01709b841c86850e1bb83b554feafe;p=thirdparty%2Fglibc.git stdlib: Verify heapsort for two-element cases Adjust the testing approach to start from scenarios with only 2 elements, as insertion sort no longer handles such cases. Signed-off-by: Kuan-Wei Chiu Reviewed-by: Adhemerval Zanella --- diff --git a/stdlib/tst-qsort4.c b/stdlib/tst-qsort4.c index 4635275419b..247917b4549 100644 --- a/stdlib/tst-qsort4.c +++ b/stdlib/tst-qsort4.c @@ -96,9 +96,7 @@ do_test (void) check_one_sort ((signed char[16]) {15, 3, 4, 2, 1, 0, 8, 7, 6, 5, 14, 13, 12, 11, 10, 9}, 16); - /* Array lengths 2 and less are not handled by heapsort_r and - deferred to insertion sort. */ - for (int i = 3; i <= 8; ++i) + for (int i = 2; i <= 8; ++i) { signed char *buf = xmalloc (i); check_combinations (i, buf, 0);