File tree Expand file tree Collapse file tree 1 file changed +5
-4
lines changed Expand file tree Collapse file tree 1 file changed +5
-4
lines changed Original file line number Diff line number Diff line change @@ -37,7 +37,8 @@ for combo in numbers2.combinations(ofCount: 2) {
37
37
```
38
38
39
39
The ` combinations(ofCounts:) ` method returns a sequence of all the different
40
- combinations of the given sizes of a collection’s elements in increasing order of size.
40
+ combinations of the given sizes of a collection’s elements in increasing order
41
+ of size.
41
42
42
43
``` swift
43
44
let numbers = [10 , 20 , 30 , 40 ]
@@ -76,9 +77,9 @@ array at every index advancement. `Combinations` does conform to
76
77
77
78
### Complexity
78
79
79
- Calling ` combinations(ofCount:) ` accesses the count of the collection, so it’s an
80
- O(1) operation for random-access collections, or an O(_ n_ ) operation otherwise.
81
- Creating the iterator for a ` Combinations ` instance and each call to
80
+ Calling ` combinations(ofCount:) ` accesses the count of the collection, so it’s
81
+ an O(1) operation for random-access collections, or an O(_ n_ ) operation
82
+ otherwise. Creating the iterator for a ` Combinations ` instance and each call to
82
83
` Combinations.Iterator.next() ` is an O(_ n_ ) operation.
83
84
84
85
### Naming
You can’t perform that action at this time.
0 commit comments