On Mon, 18 Apr 2016, Hans Petter Selasky wrote:
Are there any objections adding the following as part of documenting our
kernel's qsort function?
--- 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
"was designed to avoid the"
+ * worst case complexity of N**2, as seen with the regular quick sort
+ * functions as described by Wikipedia.
Why Wikipedia, specifically? There are a lot of places that describe
quicksort. How about just
Note: This implementation of qsort() is designed to avoid the
worst-case complexity of N**2 that is often seen with standard
firstname.lastname@example.org mailing list
To unsubscribe, send any mail to "freebsd-current-unsubscr...@freebsd.org"