Concrete Abstractions

Max Hailperin, B. K., & Knight, K. (1999). Concrete Abstractions: An Introduction to Computer Science Using Scheme. Cole Publishing.

Type

Book

Intellectual base

Textbook

Year

1999

Link

no authoritative link yet

Cited by

1 citation across 1 artifact.

Domain-specific

• Josephus problem
  • Indexing may be zero- or one-based, counting convention determines whether the current or next position starts a round, and the classical step-two closed form does not extend unchanged to arbitrary step size.

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:caaca0061e43 · see in the full table