Fix typo in comment

diff --git a/src/backend/utils/sort/tuplesort.c b/src/backend/utils/sort/tuplesort.c
index c152e43e687172b1d66634e49e66844bd2d2529f..59cd28e595f4ac0795a1f70e3e7c34e7571bb610 100644 (file)
--- a/src/backend/utils/sort/tuplesort.c
+++ b/src/backend/utils/sort/tuplesort.c
@@ -2627,7 +2627,7 @@ mergeruns(Tuplesortstate *state)
        /*
         * If we produced only one initial run (quite likely if the total data
         * volume is between 1X and 2X workMem when replacement selection is used,
-        * but something we particular count on when input is presorted), we can
+        * but something we particularly count on when input is presorted), we can
         * just use that tape as the finished output, rather than doing a useless
         * merge.  (This obvious optimization is not in Knuth's algorithm.)
         */