binary search using recursion in julia language

binary_search.jl

k=0
g=0
t=0
function binary_search(list,item,len_list)
    global k
    global g
    global t
    if list==[]
        return 0
    end
    if t==1
        return k
    end
    if last(list)==item
        k= len_list - g
        t=1
    end
    pop!(list)
    g=g+1
    return binary_search(list, item, len_list)
end

my_list = [1,3,5,6,8,10,12,21,34]
println(binary_search(my_list, 34, length(my_list)))