Weak heap
id:
weak-heap-305-280386
title:
Weak heap
text:
In computer science, a weak heap is a data structure for priority queues, combining features of the binary heap and binomial heap. It can be stored in an array as an implicit binary tree like a binary heap, and has the efficiency guarantees of binomial heaps. A sorting algorithm using weak heaps, weak-heapsort, uses a number of comparisons that is close to the theoretical lower bound on the number of comparisons required to sort a list, so is particularly useful when comparison is expensive, suc
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Weak_heap
date created:
date modified:
2023-11-30T06:20:50Z
main entity:
{"identifier":"Q25304407","url":"https://www.wikidata.org/entity/Q25304407"}
image:
fields total:
13
integrity:
13