Language Complexity (Part 4)
Azimuth 2021-03-02
Summary:
David A. Tanzer Summarizing computational complexity In Part 3 we defined, for each program P, a detailed function P'(n) that gives the worst case number of steps that P must perform when given some input of size n. Now we want to summarize P into general classes, such as linear, quadratic, etc. What’s in a […]