Ask your AI Ask your AI to turn this code into a guided bug-finding exercise.
Claude ChatGPT I am reading "A routine compares every pair among `n` records once. Which time bound describes its dominant growth?" on CodeWiki (https://codewiki.com/practice/mcq/foundations/checkpoint-1/checkpoint-1-growth/).
Context (verbatim from the page):
"""
A routine compares every pair among `n` records once. Which time bound describes its dominant growth?
`O(n²)`
`O(n)` because each individual comparison is constant-time
`O(2n)` because each pair contains two records
"""
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.