File tree Expand file tree Collapse file tree 1 file changed +16
-16
lines changed Expand file tree Collapse file tree 1 file changed +16
-16
lines changed Original file line number Diff line number Diff line change @@ -20,28 +20,28 @@ func merge<T: Comparable>(leftPile: [T], rightPile: [T]) -> [T] {
20
20
var orderedPile = [ T] ( )
21
21
22
22
while leftIndex < leftPile. count && rightIndex < rightPile. count {
23
- if leftPile [ leftIndex] < rightPile [ rightIndex] {
24
- orderedPile. append ( leftPile [ leftIndex] )
25
- leftIndex += 1
26
- } else if leftPile [ leftIndex] > rightPile [ rightIndex] {
27
- orderedPile. append ( rightPile [ rightIndex] )
28
- rightIndex += 1
29
- } else {
30
- orderedPile. append ( leftPile [ leftIndex] )
31
- leftIndex += 1
32
- orderedPile. append ( rightPile [ rightIndex] )
33
- rightIndex += 1
34
- }
23
+ if leftPile [ leftIndex] < rightPile [ rightIndex] {
24
+ orderedPile. append ( leftPile [ leftIndex] )
25
+ leftIndex += 1
26
+ } else if leftPile [ leftIndex] > rightPile [ rightIndex] {
27
+ orderedPile. append ( rightPile [ rightIndex] )
28
+ rightIndex += 1
29
+ } else {
30
+ orderedPile. append ( leftPile [ leftIndex] )
31
+ leftIndex += 1
32
+ orderedPile. append ( rightPile [ rightIndex] )
33
+ rightIndex += 1
34
+ }
35
35
}
36
36
37
37
while leftIndex < leftPile. count {
38
- orderedPile. append ( leftPile [ leftIndex] )
39
- leftIndex += 1
38
+ orderedPile. append ( leftPile [ leftIndex] )
39
+ leftIndex += 1
40
40
}
41
41
42
42
while rightIndex < rightPile. count {
43
- orderedPile. append ( rightPile [ rightIndex] )
44
- rightIndex += 1
43
+ orderedPile. append ( rightPile [ rightIndex] )
44
+ rightIndex += 1
45
45
}
46
46
47
47
return orderedPile
You can’t perform that action at this time.
0 commit comments