def sort(arr)
    (arr.size-1).downto(0) do |i|
        0.upto(i-1) do |j|
            if arr[j] > arr[j+1]
                tmp = arr[j]
                arr[j] = arr[j+1]
                arr[j+1] = tmp
            end
        end
    end
    arr
end

def find(arr, current, num)
    calc = []
    arr.each_with_index do |i|

    end
end

def foo(arr)
    arr = sort(arr)

    found = false
    i = 0
    until found do
        current = arr[i]



        i += 1
    end
end