Question
Answer the following about the art of writing elegant code, for 10 points each:
[10e] A paper by Gregory Chaitin hypothesizes elegant LISP programs that minimize his namesake form of this property, defined using program size. Big O notation is used to describe this property of an algorithm with respect to space or time.
ANSWER: complexity [accept Chaitin complexity or program-size complexity or space complexity; accept time complexity or runtime complexity]
[10m] In Literate Programming, this computer scientist defines elegance with the four criteria of leanness, clarity, spareness, and suitable implementation. He discussed program elegance in The Art of Computer Programming.
ANSWER: Donald Knuth [or Donald Ervin Knuth]
[10h] Developers may incur cost due to overengineering software in a phenomenon described as “elegance” undergoing this action, paralleling a phenomenon in which software bloat accumulates due to a product’s scope of features experiencing this issue.
ANSWER: creep [accept creeping elegance or feature creep or scope creep]
<RK, Other Science>
Summary
| 2024 ARCADIA at Claremont | 2024-11-02 | Y | 3 | 23.33 | 67% | 100% | 67% |
Data
| ALCU | SGV Ventures | 0 | 10 | 10 | 20 |
| Anderson et al. | U[C]SD | 10 | 10 | 10 | 30 |
| Claremont | Jason et al. | 10 | 10 | 0 | 20 |