Ask your AI Ask your AI to turn this code into a guided bug-finding exercise.
Claude ChatGPT I am reading "A function performs 4n² + 20n + 300 modeled operations. What is its tight asymptotic time bound?" on CodeWiki (https://codewiki.com/practice/mcq/foundations/algorithmic-complexity/dominant-term/).
Context (verbatim from the page):
"""
A function performs 4n² + 20n + 300 modeled operations. What is its tight asymptotic time bound?
Θ(1)
Θ(n)
Θ(n²)
Θ(4n² + 20n + 300) only
"""
Introduce three subtle bugs into the example above and let me find them. Reveal each answer only after I have guessed.
Answer in English. Keep code examples in CS foundations. Where you are unsure, say so.