Use linear search when distributing buffer

1 files changed, 2 insertions, 4 deletions

diff --git a/common.h b/common.h
index 8969f1d..d7e1e47 100644
--- a/common.h
+++ b/common.h
@@ -37,10 +37,8 @@ static void distribute_buffer(char *base, size_t bufnmel, size_t sortnmel, size_
 	while (bufnmel) {
 		char *sorted = base + bufnmel * width;
 
-		size_t insertpos = binary_search(base, sorted, sortnmel, width, cmp);
-		while (insertpos < sortnmel && !cmp(base, sorted + insertpos * width)) {
-			insertpos++;
-		}
+		size_t insertpos = 0;
+		for (; insertpos < sortnmel && cmp(base, sorted + insertpos * width) > 0; insertpos++);
 
 		if (insertpos > 0) {
 			rotate(base, bufnmel + insertpos, width, bufnmel);