You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
When inserting a small number of elements k into a large priority_queue, make_heap's complexity of 3N can be greater than consecutive calls to push_heap (k log N). We need to determine what the actual relationship is given our implementation's constant factors, and further determine if we believe the potential perf improvement is worth the cost of additional codesize.
The text was updated successfully, but these errors were encountered:
See discussion at #2806 (comment).
When inserting a small number of elements
k
into a largepriority_queue
,make_heap
's complexity of3N
can be greater than consecutive calls topush_heap
(k log N
). We need to determine what the actual relationship is given our implementation's constant factors, and further determine if we believe the potential perf improvement is worth the cost of additional codesize.The text was updated successfully, but these errors were encountered: