Merge pull request #8965 from gurustron/patch-3

SortedSet.Overlaps is O (n log m) in the worst case

Author: eiriktsarpalis

xml/System.Collections.Generic/SortedSet`1.xml

@@ -1707,7 +1707,7 @@
 ## Remarks  
  Any duplicate elements in `other` are ignored.  
   
- This method is an `O(n)` operation, where `n` is the number of elements in `other`.  
+ This method is an `O(n log m)` operation, where `m` is <xref:System.Collections.Generic.SortedSet%601.Count%2A> and `n` is the number of elements in `other`.  
   
  ]]></format>
         </remarks>