28 lines
1.0 KiB
Diff
28 lines
1.0 KiB
Diff
commit 1bb28b7b4f01709b841c86850e1bb83b554feafe
|
|
Author: Kuan-Wei Chiu <visitorckw@gmail.com>
|
|
Date: Tue Jan 16 10:16:57 2024 +0800
|
|
|
|
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 <visitorckw@gmail.com>
|
|
Reviewed-by: Adhemerval Zanella <adhemerval.zanella@linaro.org>
|
|
|
|
diff --git a/stdlib/tst-qsort4.c b/stdlib/tst-qsort4.c
|
|
index 4cf373f22e28fade..7909793d9eb3edc7 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);
|