Hello. I suggest also add a short description of how it was achieved (randomization?).
On Mon, 18 Apr 2016 13:43:38 +0200 Hans Petter Selasky <h...@selasky.org> wrote: > Hi, > > Are there any objections adding the following as part of documenting > our kernel's qsort function? > > Index: sys/libkern/qsort.c > =================================================================== > --- sys/libkern/qsort.c (revision 298202) > +++ sys/libkern/qsort.c (working copy) > @@ -45,6 +45,10 @@ > > /* > * Qsort routine from Bentley & McIlroy's "Engineering a Sort > Function". > + * > + * NOTE: This implementation of qsort() was designed to not have the > + * worst case complexity of N**2, as seen with the regular quick sort > + * functions as described by Wikipedia. > */ > > > --HPS > _______________________________________________ > freebsd-current@freebsd.org mailing list > https://lists.freebsd.org/mailman/listinfo/freebsd-current > To unsubscribe, send any mail to > "freebsd-current-unsubscr...@freebsd.org" > -- Best regards, Aleksander Alekseev http://eax.me/ _______________________________________________ freebsd-current@freebsd.org mailing list https://lists.freebsd.org/mailman/listinfo/freebsd-current To unsubscribe, send any mail to "freebsd-current-unsubscr...@freebsd.org"
