Correct time complexity of List<T>.InsertRange (dotnet#4693)

svick · Ron Petrusha · commit 6f6635d3ec48 · 2018-03-17T09:22:48.000-07:00
diff --git a/xml/System.Collections.Generic/List`1.xml b/xml/System.Collections.Generic/List`1.xml
@@ -2430,7 +2430,7 @@ Public Function StartsWith(e As Employee) As Boolean
   
  The order of the elements in the collection is preserved in the <xref:System.Collections.Generic.List%601>.  
   
- This method is an O(*n* + *m*) operation, where *n* is the number of elements to be added and *m* is <xref:System.Collections.Generic.List%601.Count%2A>.  
+ This method is an O(*n* * *m*) operation, where *n* is the number of elements to be added and *m* is <xref:System.Collections.Generic.List%601.Count%2A>.  
   
    
   

Original file line number	Diff line number	Diff line change
`@@ -2430,7 +2430,7 @@ Public Function StartsWith(e As Employee) As Boolean`
`2430`	`2430`
`2431`	`2431`	`The order of the elements in the collection is preserved in the <xref:System.Collections.Generic.List%601>.`
`2432`	`2432`
`2433`		`- This method is an O(n + m) operation, where n is the number of elements to be added and m is <xref:System.Collections.Generic.List%601.Count%2A>.`
	`2433`	`+ This method is an O(n * m) operation, where n is the number of elements to be added and m is <xref:System.Collections.Generic.List%601.Count%2A>.`
`2434`	`2434`
`2435`	`2435`
`2436`	`2436`