Assertion: priority queue | /r/CapableOf | give o(log nperformance
Facets:
value: to build
type: PURPOSE
value: for inserts
type: PURPOSE
value: for removals
type: PURPOSE
Source sentences:
text: To improve performance, priority queues typically use a heap as their backbone, giving O(log n) performance for inserts and removals, and O(n) to build initially from a set of n elements.