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 <sys/cdefs.h> 32__FBSDID("$FreeBSD: releng/10.2/tools/regression/lib/libc/stdlib/test-heapsort.c 137587 2004-11-11 19:47:55Z nik $"); 33 34#include <assert.h> 35#include <stdio.h> 36#include <stdlib.h> 37 38#include "test-sort.h" 39 40int 41main(int argc, char *argv[]) 42{ 43 int i, j; 44 int testvector[IVEC_LEN]; 45 int sresvector[IVEC_LEN]; 46 47 printf("1..1\n"); 48 for (j = 2; j < IVEC_LEN; j++) { 49 /* Populate test vectors */ 50 for (i = 0; i < j; i++) 51 testvector[i] = sresvector[i] = initvector[i]; 52 53 /* Sort using heapsort(3) */ 54 heapsort(testvector, j, sizeof(testvector[0]), sorthelp); 55 /* Sort using reference slow sorting routine */ 56 ssort(sresvector, j); 57 58 /* Compare results */ 59 for (i = 0; i < j; i++) 60 assert(testvector[i] == sresvector[i]); 61 } 62 63 printf("ok 1 - heapsort\n"); 64 65 return(0); 66} 67