Yeah but does a priorityqueue reorder itself better than O(n)

Question

Java

Benedikt

Yeah but does a priorityqueue reorder itself better than O(n)

when a value in it changes?

0

20.03.2019

2 ответов

11 просмотров

dog Ass

Yes.

0

20.03.2019

dog Ass · Accepted Answer

dog Ass

See, read about heap data structure. Its insertion and deletion is O(log(n)), where n is the number of elements. That means a heap can give you the minimum (a min-heap) or maximum (max-heap) in logarithmic time complexity.

0

20.03.2019

Похожие чаты

Yeah but does a priorityqueue reorder itself better than O(n)

2 ответов

Похожие вопросы