Teken aan
Besonderhede van voorbeeld: -239854035261655900
terug
Metadata
Author:
WikiMatrix
Data
English
[en]
For the Fibonacci heap, the find-minimum operation takes constant (O(1)) amortized time.
Korean
[ko]
피보나치 힙에서, 최솟값 탐색(find-minimum) 연산은 분할 상환된 시간이 상수인(O(1)) 만큼 소요된다.
History
Your action:
Comment
Mark incorrect example
Please enable JavaScript.