diff options
| author |   Paul Vinciguerra <pvinci@vinciconsulting.com> | 2018-09-24 05:25:00 -0700 |
|---|---|---|
| committer |   Florin Coras <florin.coras@gmail.com> | 2018-09-27 19:59:44 +0000 |
| commit | ec11b13a21b2becc1d1bd746a04624d17b26583f (patch) | |
| tree | f3b432a3713a8edd2041ff025157d7b0803be580 /src/vppinfra/qsort.c | |
| parent | 7d426535b4e98731193cc0265b83f2336dcdf5b3 (diff) | |
Trivial: Cleanup some typos.
This is a new commit for code under a different maintainer.
Change-Id: I79fa403fec6a312238a9a4b18b35dbcafaa05439
Signed-off-by: Paul Vinciguerra <pvinci@vinciconsulting.com>
Diffstat (limited to 'src/vppinfra/qsort.c')
| -rw-r--r-- | src/vppinfra/qsort.c | 2 |
1 files changed, 1 insertions, 1 deletions
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 |