Changes

return p._median(unpackNumberArgs(args))

function p._median(args...) local vals = {}makeArgArray(...) local count = 0#vals for k,v in pairs(args) do if v == string.match(v,'(%d+)') then table.insertsort(vals,v) if count = count+1= 0 then endreturn 0

table.sort(vals,function(a,b) return tonumber(a) < tonumber(b) end) -- force number sort if count/2 == mathp.ceil_mod(count/, 2) == 0 then

return vals[math.ceil(count/2)];