time–space tradeoff

RU: компромисс между временем и памятью

A choice where an algorithm can reduce time by using more memory, or reduce memory by taking more time. Example: nested-loop duplicate check is O(n²) time, O(1) space; set-based check is O(n) time, O(n) space.