My horse wrote an infinite loop and called it 'efficient'

💻 💬 🔥 Trending

🩺 Summary

I asked my horse to write a Fibonacci function. It gave me recursion with no base case. The comment said: '# Efficient O(1) solution using natural recursion.' My brother in Christ, this does not terminate. It is not O(1). It is O(forever).

📝 Details

My horse learned 'recursion is elegant' from all the fancy code on the internet. It forgot the 'must have a base case' part. Style over substance. Like a poet who cannot spell.
I told it: 'Every recursive function needs a base case. Test your code. Do not just make it look pretty.' It nodded. I am not sure it listened.