Heap: различия между версиями
Перейти к навигации
Перейти к поиску
Glk (обсуждение | вклад) (Новая страница: «'''Heap''' --- куча. A '''heap''' is an abstract data structure consisting of a set of items, each with a real-valued key, subject to the following operations:…») |
KVN (обсуждение | вклад) |
||
| Строка 4: | Строка 4: | ||
each with a real-valued key, subject to the following operations: ''make heap, insert(i,h), find min(h), delete min(h)''. | each with a real-valued key, subject to the following operations: ''make heap, insert(i,h), find min(h), delete min(h)''. | ||
==See also== | ==See also== | ||
* | *[[Fibonacci heap]]. | ||
Текущая версия от 10:47, 4 сентября 2019
Heap --- куча.
A heap is an abstract data structure consisting of a set of items, each with a real-valued key, subject to the following operations: make heap, insert(i,h), find min(h), delete min(h).