Przejdź do treści

Jednoczesne wyszukiwanie minimum i maksimum

Opis problemu

Podejście naiwne

Podejście optymalne

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
function MinMax(array)
    minCandidates = []
    maxCandidates = []

    for i in 2:2:length(array)
        if array[i - 1] < array[i]
            push!(minCandidates, array[i - 1])
            push!(maxCandidates, array[i])
        else
            push!(minCandidates, array[i])
            push!(maxCandidates, array[i - 1])
        end
    end

    if length(array) % 2 == 1
        push!(minCandidates, array[end])
        push!(maxCandidates, array[end])
    end

    minValue = minCandidates[1]
    maxValue = maxCandidates[1]

    for i in eachindex(minCandidates)
        minValue = min(minValue, minCandidates[i])
        maxValue = max(maxValue, maxCandidates[i])
    end

    return minValue, maxValue
end

array = [3, 6, 1, 9, 10, 4, -4, 6, 12, 5, 11]
println(MinMax(array))