===================================================================
RCS file: /cvsrepo/anoncvs/cvs/src/usr.bin/sort/sort.1,v
retrieving revision 1.57
retrieving revision 1.58
diff -u -r1.57 -r1.58
--- src/usr.bin/sort/sort.1	2017/06/10 14:54:42	1.57
+++ src/usr.bin/sort/sort.1	2019/02/24 09:57:43	1.58
@@ -1,4 +1,4 @@
-.\"	$OpenBSD: sort.1,v 1.57 2017/06/10 14:54:42 schwarze Exp $
+.\"	$OpenBSD: sort.1,v 1.58 2019/02/24 09:57:43 anton Exp $
 .\"
 .\" Copyright (c) 1991, 1993
 .\"	The Regents of the University of California.  All rights reserved.
@@ -32,7 +32,7 @@
 .\"
 .\"     @(#)sort.1	8.1 (Berkeley) 6/6/93
 .\"
-.Dd $Mdocdate: June 10 2017 $
+.Dd $Mdocdate: February 24 2019 $
 .Dt SORT 1
 .Os
 .Sh NAME
@@ -339,7 +339,7 @@
 .Fl s .
 .It Fl Fl help
 Print the help text and exit.
-.It Fl Fl mergesort , Fl H
+.It Fl H , Fl Fl mergesort
 Use mergesort.
 This is a universal algorithm that can always be used,
 but it is not always the fastest.