xref: /freebsd/lib/libc/tests/stdlib/heapsort_test.c (revision 397e83df75e0fcd0d3fcb95ae4d794cb7600fc89)
1 /*-
2  * Copyright (C) 2004 Maxim Sobolev <sobomax@FreeBSD.org>
3  * All rights reserved.
4  *
5  * Redistribution and use in source and binary forms, with or without
6  * modification, are permitted provided that the following conditions
7  * are met:
8  * 1. Redistributions of source code must retain the above copyright
9  *    notice, this list of conditions and the following disclaimer.
10  * 2. Redistributions in binary form must reproduce the above copyright
11  *    notice, this list of conditions and the following disclaimer in the
12  *    documentation and/or other materials provided with the distribution.
13  *
14  * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
15  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
16  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
17  * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
18  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
19  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
20  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
21  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
22  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
23  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
24  * SUCH DAMAGE.
25  */
26 
27 /*
28  * Test for heapsort() routine.
29  */
30 
31 #include <assert.h>
32 #include <stdio.h>
33 #include <stdlib.h>
34 
35 #include "test-sort.h"
36 
37 ATF_TC_WITHOUT_HEAD(heapsort_test);
38 ATF_TC_BODY(heapsort_test, tc)
39 {
40 	int sresvector[IVEC_LEN];
41 	int testvector[IVEC_LEN];
42 	int i, j;
43 
44 	for (j = 2; j < IVEC_LEN; j++) {
45 		/* Populate test vectors */
46 		for (i = 0; i < j; i++)
47 			testvector[i] = sresvector[i] = initvector[i];
48 
49 		/* Sort using heapsort(3) */
50 		heapsort(testvector, j, sizeof(testvector[0]), sorthelp);
51 		/* Sort using reference slow sorting routine */
52 		ssort(sresvector, j);
53 
54 		/* Compare results */
55 		for (i = 0; i < j; i++)
56 			ATF_CHECK_MSG(testvector[i] == sresvector[i],
57 			    "item at index %d didn't match: %d != %d",
58 			    i, testvector[i], sresvector[i]);
59 	}
60 }
61 
62 ATF_TP_ADD_TCS(tp)
63 {
64 
65 	ATF_TP_ADD_TC(tp, heapsort_test);
66 
67 	return (atf_no_error());
68 }
69