input bound

RU: граница входа

A lower bound on algorithm complexity determined by the size of the input itself: any algorithm that must examine all n input elements cannot run faster than Ω(n), regardless of implementation. This information-theoretic floor bounds what is achievable.