Horrible Brute Force Priority Queue

list = 
{ 
  {n="old", p=1}
}

function add(effect)

    for i = 1, #list do

        local priority = list[i].p

        if effect.p > priority then
            table.insert(list, i, effect)
            return
        end
    end

    table.insert(list, effect)
end

print("List before")
for k, v in ipairs(list) do
    print(k, string.format("{n=%s, p=%d}", v.n, v.p))
end

add({n="new", p=1})

print("List after")
for k, v in ipairs(list) do
    print(k, string.format("{n=%s, p=%d}", v.n, v.p))
end