Gap based priority queue / sorting?
I'm looking for a priority q开发者_如何学Pythonueue based on a sorted array with gaps. Gaps could be used whenever a place was needed to put in an object. Gaps were be periodically "spread out" in amortized time.
I've seen an article like that but I've lost it and can't find it any more. Can you help?
This sounds like it is related to the Librarian Sort.
精彩评论