Exam-style question
Try this first
Explain how algorithmic complexity and hardware can combine to limit a computation. Use an example involving an algorithm processing increasingly large inputs.
Model answer
What a good answer should say
- As the input size increases, an algorithm may require substantially more processing time or memory.
- Hardware has finite processing speed and finite memory, so eventually the resources required by the algorithm may exceed what the computer can provide within an acceptable time or within its available memory.
- For example, an algorithm that is manageable for a small input may take an impractically long time when the input is much larger.
- The limitation is therefore practical: the computation may be possible in principle but not feasible on the available hardware for that input size.
Explanation
Why this works
A strong answer links both parts of the requirement. It explains that complexity determines how resource needs grow and that hardware supplies only finite resources.
It should also distinguish an impractical computation from proof that no solution exists.
Common mistake
No common mistake is linked to this question yet.