Skip to content

Commit

Permalink
Merge pull request #8965 from gurustron/patch-3
Browse files Browse the repository at this point in the history
SortedSet.Overlaps is O (n log m) in the worst case
  • Loading branch information
eiriktsarpalis committed Apr 20, 2023
2 parents 698889f + 0d90868 commit d0ff45b
Showing 1 changed file with 1 addition and 1 deletion.
2 changes: 1 addition & 1 deletion xml/System.Collections.Generic/SortedSet`1.xml
Original file line number Diff line number Diff line change
Expand Up @@ -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>
Expand Down

0 comments on commit d0ff45b

Please sign in to comment.