##Priority queue
Heap-based generic concurrent priority queue for .NET
Priority queue is an abstract data type which is like a regular queue or
stack data structure, but where additionally each element has a "priority"
associated with it. In a priority queue, an element with high priority is
served before an element with low priority. If two elements have the same
priority, they are served according to their order in the queue.
This data structure makes random choices in arranging the entries in such
a way that search and update times are O(log N) on average, where N is the number
of entries in the list. Interestingly, the notion of average time complexity
used here does not depend on the probability distribution of the keys in the input.
Instead, it depends on the use of a random-number generator in the implementation
of the insertions to help decide where to place the new entry.
[Detailed overview] (https://msdn.microsoft.com/en-us/library/ms379573(VS.80).aspx#datastructures20_4_topic4) of skip list and a simple implementation.
请发表评论