bs.jl

cost = [10, 10, 10, 10, 1, 1, 1]

function count_no_improvements(x)
    counter = 0

    for i in 1:size(x, 1)
        if (i > 1) && abs(x[i] - x[i-1]) < (1e-6 * x[i])
            counter += 1
        else
            counter = 0
        end
    end
    return counter
end