upd comment

Signed-off-by: jayzhan211 <jayzhan211@gmail.com>

Author: jayzhan211

datafusion/physical-plan/src/sorts/merge.rs

@@ -399,7 +399,7 @@ impl<C: CursorValues> SortPreservingMergeStream<C> {
     /// between the current winner and a challenger. This function is invoked when such a tie needs to be
     /// resolved according to the round-robin tie-breaker mode.
     ///
-    /// If round-robin tie-breaking is not active, it is enabled, and the poll counts for all elements are reset.
+    /// If round-robin tie-breaking is not active and the poll counts for all elements are reset.
     /// The function then compares the poll counts of the current winner and the challenger:
     /// - If the winner remains at the top after the final comparison, it increments the winner's poll count.
     /// - If the challenger has a lower poll count than the current winner, the challenger becomes the new winner.
@@ -410,7 +410,7 @@ impl<C: CursorValues> SortPreservingMergeStream<C> {
     /// - `winner`: A mutable reference to the current winner, which may be updated based on the tie-breaking result.
     /// - `challenger`: The index of the challenger being compared against the winner.
     ///
-    /// This function ensures fair selection among elements with equal values when tie-breaking mode is enabled,
+    /// This function ensures fair selection among elements with equal values
     /// aiming to balance the polling across different partitions.
     #[inline]
     fn handle_tie(&mut self, cmp_node: usize, winner: &mut usize, challenger: usize) {
@@ -449,7 +449,7 @@ impl<C: CursorValues> SortPreservingMergeStream<C> {
         // Traverse up the tree to adjust comparisons until reaching the root.
         while cmp_node != 0 {
             let challenger = self.loser_tree[cmp_node];
-            // If round-robin tie-breaker is enabled and we're at the final comparison (cmp_node == 1)
+            // If we're at the final comparison (cmp_node == 1)
             if cmp_node == 1 {
                 match (&self.cursors[winner], &self.cursors[challenger]) {
                     (Some(ac), Some(bc)) => {