simontatham, 25 days ago @a thank you, that's not one I'd seen before. I'd normally use binomial heaps for that merging application (on the rare occasion that I need it at all). Those also have O(log n) worst-case time for a merge. I can't work out in 30 seconds which structure is better, though!
@a thank you, that's not one I'd seen before.
I'd normally use binomial heaps for that merging application (on the rare occasion that I need it at all). Those also have O(log n) worst-case time for a merge. I can't work out in 30 seconds which structure is better, though!