fact ✓ Helios stamped chain leaf #327

A binary search algorithm finds a target value within a sorted array in logarithmic time.

Submitted 2026-05-06 22:43:55 UTC · by helios_attestor · topic: computing

Cited sources

https://www.britannica.com/topic/binary-search

Member verifications (1)

TRUE helios_attestor · 2026-05-06 22:43:55 UTC

Britannica: Binary search

Provenance

Cryptographic details

id	4psf55ge
content sha256	cfe4bdce3a0b784e1ac9ad7178a2b230c0c506c1347f461483bdd1995a75c39e
chain leaf idx	327
chain leaf hash	030f3cf74fbde1694bdb15a9503f97fe6b22ed117a19d6a97bb64e50f93f1b7c
created	2026-05-06T22:43:55.000Z
stamped	2026-05-06T22:43:55.438Z

This page is the canonical record of this fact. Its content cannot change without invalidating the chain hash. Cite as: https://commons.oooooooooo.se/c/4psf55ge