The Art of Computer Programming, Volume 3

Donald E. Knuth, T. A. o. C. P., Sorting, V. 3., & Searching, 2. e. (1998). The Art of Computer Programming, Volume 3: Sorting and Searching. Addison-Wesley.

Type

Unclassified

Intellectual base

Unclassified

Year

1998

Link

no authoritative link yet

Cited by

5 citations across 5 artifacts.

Domain-specific

• Division (mathematics)
  • The entry records a descriptive analytical identity; practical use requires the governing domain's evidence, standards, and safety obligations.
• Infix notation
  • … transfers from A canonical instance directly demonstrates that each infix operator appears between the operands it combines and the declared parsing rules determine one intended syntax tree. to An applied instance preserves the same invariant under a changed scale, notation, jurisdiction, or implementation..
• Random number generation
  • Random number generation is the process of producing a sequence of numbers or symbols under a stated randomness model, using physical sampling, pseudorandom algorithms, or a qualified combination of entropy acquisition and deterministic expansion.
• Running total
  • The entry records a descriptive analytical identity; practical use requires the governing domain's evidence, standards, and safety obligations.
• Tournament sort
  • … identity and a convenient observable transfers from Leaves hold records, internal nodes hold the smaller child and each emitted minimum is replaced by infinity before replaying its path. to External sorting uses replacement selection variants to create long initial runs and accounts for memory and I/O separately..

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:78137d5cd648 · see in the full table