From 68d3790ba0bce162f9fcaed09cfecd9adeab3943 Mon Sep 17 00:00:00 2001
From: Cyril Zhang <cyril@freebsdfoundation.org>
Date: Thu, 17 Jun 2021 13:40:16 -0400
Subject: [PATCH] sort: Change default algorithm to mergesort

This results in a significant improvement in the runtime of sort(1) when
radix sort cannot be used.  This comes at the expense of increased
memory usage, but this is small relative to sort's overall memory usage.

PR:		255551
Reviewed by:	markj
Sponsored by:	The FreeBSD Foundation
Differential Revision:	https://reviews.freebsd.org/D30319
---
 usr.bin/sort/file.h | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/usr.bin/sort/file.h b/usr.bin/sort/file.h
index 724928a7c05..70b46fecaca 100644
--- a/usr.bin/sort/file.h
+++ b/usr.bin/sort/file.h
@@ -41,8 +41,8 @@
 #define	SORT_HEAPSORT	3
 #define	SORT_RADIXSORT  4
 
-#define	DEFAULT_SORT_ALGORITHM SORT_HEAPSORT
-#define	DEFAULT_SORT_FUNC heapsort
+#define	DEFAULT_SORT_ALGORITHM SORT_MERGESORT
+#define	DEFAULT_SORT_FUNC mergesort
 
 /*
  * List of data to be sorted.