X-Git-Url: https://gerrit.fd.io/r/gitweb?a=blobdiff_plain;f=src%2Fvppinfra%2Fqsort.c;h=145ae40fe91dc38a1fc283a68b67107e06569577;hb=8c8acc0;hp=2faa5897eb2638e28422c5a79e6a099eefc0378c;hpb=7cd468a3d7dee7d6c92f69a0bb7061ae208ec727;p=vpp.git

diff --git a/src/vppinfra/qsort.c b/src/vppinfra/qsort.c
index 2faa5897eb2..145ae40fe91 100644
--- 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