aboutsummaryrefslogtreecommitdiff
path: root/include/libn/macro/qsort.h
diff options
context:
space:
mode:
Diffstat (limited to 'include/libn/macro/qsort.h')
-rw-r--r--include/libn/macro/qsort.h3
1 files changed, 3 insertions, 0 deletions
diff --git a/include/libn/macro/qsort.h b/include/libn/macro/qsort.h
index cc38bca..2ff964a 100644
--- a/include/libn/macro/qsort.h
+++ b/include/libn/macro/qsort.h
@@ -1,12 +1,15 @@
#pragma once
/*
+ * Nicholas Noll (2020)
* Straight implementation of Sedgewick's median qsort
+ * #ref: "Implementing Quicksort Programs" (1978)
*
* @LEN: name of parameter length
* @QLESS: name of function that computes array[i] < array[j]
* should return a boolean
* @QSWAP: name of function that swaps array[i] <-> array[j]
+ * this could swap multiple arrays
*
* NOTE: This can perform on strided arrays.
* Make sure to use parens liberally to ensure hygeine!