← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

16 第16章 摊还分析

Fourth edition · 核验版本的摘录快照 · 导入于 2026-10-23T08:18:08.703Z

It is convenient to use a concept introduced in Section 11.2, where we analyzed hashing.

The load factor α(T) of a nonempty table T is defined as the number of items stored in the table divided by the size (number of slots) of the table.

An empty table (one with no slots) has size 0, and its load factor is defined to be 1. If

此预览只包含定位所需的摘录和上下文。

原书定位详情

来源:a19c7933-4eda-4176-aebd-30fe7e1ad292

正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter016.xhtml

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea