Well, no. But its close enough.
local laps = {}
for _ = 1, 100 do
x = wait(1)
table.insert(laps, x)
end
local total = 0
for _, n in pairs (laps) do
total = total + n
end
print("Average wait time: " .. tostring(total / 100))
print("Fastest wait time: " .. tostring(math.min(unpack(laps))))
Average wait time: 1.0057205884125
Fastest wait time: 1.0018424154567 |