Fill buffer with smallest elements

This avoids the need to distribute the buffer through the whole array at
the end.  It also allows us to skips most of the work for sorted and
reverse-sorted inputs.

1 files changed, 1 insertions, 1 deletions

diff --git a/counts.c b/counts.c
index d1f3910..f644706 100644
--- a/counts.c
+++ b/counts.c
@@ -30,7 +30,7 @@ void add_counts(struct counts *target, struct counts *snapshot)
 
 void print_counts(void)
 {
-	char *labels[] = {"total", "sortnet", "overlap", "merge", "move buffer", "distribute"};
+	char *labels[] = {"total", "sortnet", "check sorted", "steal buffer", "overlap", "merge", "distribute" };
 	for (int i = 0; i < MAX_COUNTS; i++) {
 		const struct counts *c = counts+i;
 		dprintf(42, "%12s: %10lu cmp, %10lu swap, %10lu rotate\n", labels[i], c->compare, c->swap, c->rotate);