👉 Deknight is a concept in computational complexity theory that describes the trade-off between running time and space requirements of an algorithm. It is named after the American computer scientist William F. Dekking, who first introduced it in 1974. The term "deknight" refers to the process by which an algorithm must choose its input data structure (e.g., a list or a set) based on the size of that input. The choice made for each input element is based on the
