iskolbin / binaryheap Goto Github PK

BH = require("BinaryMaxHeap")

math.randomseed(0)
bh = BH.new(  )
for i = 1, 1000000 do
        bh:enqueue(i, math.random(0, 1000000000))
end

errors = 0
_, oldNum = bh:dequeue()
while(true) do
        _, newNum = bh:dequeue()
        if newNum and newNum < oldNum then
				oldNum = newNum
                print("Error:", oldNum, newNum)
				errors = errors +1
        else
				oldNum = newNum
                break
        end
end

print("Errors:", errors)