|
1 | 1 | // Compare each item to find minimum
|
2 | 2 | func minimum<T: Comparable>(_ array: [T]) -> T? {
|
3 |
| - var array = array |
4 |
| - guard !array.isEmpty else { |
5 |
| - return nil |
6 |
| - } |
7 |
| - |
8 |
| - var minimum = array.removeFirst() |
9 |
| - for element in array { |
10 |
| - minimum = element < minimum ? element : minimum |
11 |
| - } |
12 |
| - return minimum |
| 3 | + var array = array |
| 4 | + guard !array.isEmpty else { |
| 5 | + return nil |
| 6 | + } |
| 7 | + |
| 8 | + var minimum = array.removeFirst() |
| 9 | + for element in array { |
| 10 | + minimum = element < minimum ? element : minimum |
| 11 | + } |
| 12 | + return minimum |
13 | 13 | }
|
14 | 14 |
|
15 | 15 | // Compare each item to find maximum
|
16 | 16 | func maximum<T: Comparable>(_ array: [T]) -> T? {
|
17 |
| - var array = array |
18 |
| - guard !array.isEmpty else { |
19 |
| - return nil |
20 |
| - } |
21 |
| - |
22 |
| - var maximum = array.removeFirst() |
23 |
| - for element in array { |
24 |
| - maximum = element > maximum ? element : maximum |
25 |
| - } |
26 |
| - return maximum |
| 17 | + var array = array |
| 18 | + guard !array.isEmpty else { |
| 19 | + return nil |
| 20 | + } |
| 21 | + |
| 22 | + var maximum = array.removeFirst() |
| 23 | + for element in array { |
| 24 | + maximum = element > maximum ? element : maximum |
| 25 | + } |
| 26 | + return maximum |
27 | 27 | }
|
28 | 28 |
|
29 | 29 | // Compare in pairs to find minimum and maximum
|
30 | 30 | func minimumMaximum<T: Comparable>(_ array: [T]) -> (minimum: T, maximum: T)? {
|
31 |
| - var array = array |
32 |
| - guard !array.isEmpty else { |
33 |
| - return nil |
| 31 | + var array = array |
| 32 | + guard !array.isEmpty else { |
| 33 | + return nil |
| 34 | + } |
| 35 | + |
| 36 | + var minimum = array.first! |
| 37 | + var maximum = array.first! |
| 38 | + |
| 39 | + let hasOddNumberOfItems = array.count % 2 != 0 |
| 40 | + if hasOddNumberOfItems { |
| 41 | + array.removeFirst() |
| 42 | + } |
| 43 | + |
| 44 | + while !array.isEmpty { |
| 45 | + let pair = (array.removeFirst(), array.removeFirst()) |
| 46 | + |
| 47 | + if pair.0 > pair.1 { |
| 48 | + if pair.0 > maximum { |
| 49 | + maximum = pair.0 |
| 50 | + } |
| 51 | + if pair.1 < minimum { |
| 52 | + minimum = pair.1 |
| 53 | + } |
| 54 | + } else { |
| 55 | + if pair.1 > maximum { |
| 56 | + maximum = pair.1 |
| 57 | + } |
| 58 | + if pair.0 < minimum { |
| 59 | + minimum = pair.0 |
| 60 | + } |
34 | 61 | }
|
35 |
| - |
36 |
| - var minimum = array.first! |
37 |
| - var maximum = array.first! |
38 |
| - |
39 |
| - let hasOddNumberOfItems = array.count % 2 != 0 |
40 |
| - if hasOddNumberOfItems { |
41 |
| - array.removeFirst() |
42 |
| - } |
43 |
| - |
44 |
| - while !array.isEmpty { |
45 |
| - let pair = (array.removeFirst(), array.removeFirst()) |
46 |
| - |
47 |
| - if pair.0 > pair.1 { |
48 |
| - if pair.0 > maximum { |
49 |
| - maximum = pair.0 |
50 |
| - } |
51 |
| - if pair.1 < minimum { |
52 |
| - minimum = pair.1 |
53 |
| - } |
54 |
| - } else { |
55 |
| - if pair.1 > maximum { |
56 |
| - maximum = pair.1 |
57 |
| - } |
58 |
| - if pair.0 < minimum { |
59 |
| - minimum = pair.0 |
60 |
| - } |
61 |
| - } |
62 |
| - } |
63 |
| - |
64 |
| - return (minimum, maximum) |
| 62 | + } |
| 63 | + |
| 64 | + return (minimum, maximum) |
65 | 65 | }
|
66 | 66 |
|
67 | 67 | // Test of minimum and maximum functions
|
|
0 commit comments