Trivial: Cleanup some typos.

[vpp.git] / src / vppinfra / qsort.c

diff --git a/src/vppinfra/qsort.c b/src/vppinfra/qsort.c
index 2faa589..145ae40 100644 (file)
--- a/src/vppinfra/qsort.c
+++ b/src/vppinfra/qsort.c
@@ -133,7 +133,7 @@ qsort (void *base, uword n, uword size,
  * of the first, last and middle elements).  (Using this median instead of
  * the first element is a big win). Then, the usual partitioning/swapping,
  * followed by moving the discriminator into the right place.  Then, figure
- * out the sizes of the two partions, do the smaller one recursively and the
+ * out the sizes of the two partitions, do the smaller one recursively and the
  * larger one via a repeat of this code.  Stopping when there are less than
  * THRESH elements in a partition and cleaning up with an insertion sort (in
  * our caller) is a huge win. All data swaps are done in-line, which is