
			/*
			* Algorithm from N. Wirth's book, implementation by N. Devillard.
			* This code in public domain.
			*/


			#define ELEM_SWAP(a,b) { register double t=(a);(a)=(b);(b)=t; }


			/*---------------------------------------------------------------------------
			Function : kth_smallest()
			In : array of elements, # of elements in the array, rank k
			Out : one element
			Job : find the kth smallest element in the array
			Notice : use the median() macro defined below to get the median.

			Reference:

			Author: Wirth, Niklaus
			Title: Algorithms + data structures = programs
			Publisher: Englewood Cliffs: Prentice-Hall, 1976
			Physical description: 366 p.
			Series: Prentice-Hall Series in Automatic Computation

			---------------------------------------------------------------------------*/


			double kth_smallest(double a[], int n, int k)
			{
			register int i,j,l,m ;
			register double x ;

			l=0 ; m=n-1 ;
			while (l<m) {
			x=a[k] ;
			i=l ;
			j=m ;
			do {
			while (a[i]<x) i++ ;
			while (x<a[j]) j-- ;
			if (i<=j) {
			ELEM_SWAP(a[i],a[j]) ;
			i++ ; j-- ;
			}
			} while (i<=j) ;
			if (j<k) l=i ;
			if (k<i) m=j ;
			}
			return a[k] ;
			}

R1448/ChiBenchmark/lenstoolchi/liblt/wirth.c
c99f2e455a51floattest

wirth.c
View Options