As Knuth's structured program correspondence and later Papadimitriou's complexity-theoretic work show, space complexity O(2^n * n) is non-trivially burdensome and co-determines algorithmic feasibility.
?Rate how convincing each reason is below to see the overall strength.
No one has weighed in yet. Be the first to share reasons for or against this statement.
Sign in or register to share your perspective on this statement.
O(2^n * n) notation(describing the rate of growth of memory usage)
Big O notation is a shorthand way to describe how much slower or bigger a problem becomes as the input size grows; this particular notation means the memory requirement grows exponentially (doubles with each additional input).
Space complexity(describing memory requirements of algorithms)
A measure of how much computer memory (storage space) an algorithm needs to run, rather than how fast it runs.
algorithm(Philosophy of computation and information)
A fundamental concept in information and computation theory, accepted as a primitive notion alongside data set