Zivjo!
On Tue, 19 Dec 2000, [EMAIL PROTECTED] wrote:
> Vem samo, da je v C-ju na voljo ena lepa funkcija, ki se ji rece
> qsort in ki uporablja quicksort in je hitra.
Se strinjam s povedanim, quick-sort je ze star in preizkusen ter hiter
algoritem.
'man qsort' vrne sledece:
NAME
qsort - sorts an array
SYNOPSIS
#include <stdlib.h>
void qsort(void *base, size_t nmemb, size_t size,
int (*compar)(const void *, const void *))
DESCRIPTION
The qsort() function sorts an array with nmemb elements of size size. The
base argument points to the start of the
array.
The contents of the array are sorted in ascending order according to a
comparison function pointed to by compar, which
is called with two arguments that point to the objects being compared.
The comparison function must return an integer less than, equal to, or
greater than zero if the first argument is con�
sidered to be respectively less than, equal to, or greater than the second. If
two members compare as equal, their
order in the sorted array is undefined.
RETURN VALUE
The qsort() function returns no value.
CONFORMING TO
SVID 3, POSIX, BSD 4.3, ISO 9899
SEE ALSO
sort(1)
Ce se uporablja floating point je primerjava malce drugacna
od x==y. Uporabiti je potrebno namrec x-y<epsilon kjer
je epsilon dovolj majhna.
--
best regards,
Rok Papez.
