René Scharfe <l.s.r@xxxxxx> writes: > Use prio_queue to improve worst-case performance at the cost of slightly > worse best-case performance. Then add and use prio_queue_replace() to > recover that loss. Would change in the tiebreaking behaviour (aka sort stability) also a cost of this change, as this swaps use of sorted linearly linked list with priority queue?
