33kb

Fibonacci heap is a heap of time with good flat data structure. I am using C language to implement Fibonacci heap.

说明：斐波那契堆是一种具有较好平摊时间的堆数据结构。我使用C语言来实现斐波那契堆。

41kb

As you increase the heap size on a consistent workload, the mark and sweep phases will continue to take approximately the same length of time.

当您增加统一工作负载上的堆大小时，标记和清扫阶段将继续花费大致相同的时间完成操作。

52kb

Unfortunately, an associated downside to increased heap size is a corresponding increase in the amount of time needed to find and process objects that should be garbage collected.

遗憾的是，增加堆大小的一个缺点是查找和处理需要垃圾收集的对象所需的时间也会随之增加。