Which notation describes algorithm efficiency as input size grows? 👤 By TheQuizWire ✅ Fact Checked 📊 Difficulty Hard 📅 Last Updated 01 Dec 2025 A. Big O Notation B. Recursive Function C. Moore's Law D. Binary Code Check Answer 💡 Explanation: Big O notation mathematically describes the complexity and performance of an algorithm relative to input size. 📚 Topics: Computer Science Technology and Computing 🎯 Exams: CSS GEN NTS PMS
