Which notation describes algorithm efficiency as input size grows? 👤 By The Quiz Wire ✅ Fact Checked 📊 Difficulty Hard 📅 Last Updated 01 Dec 2025 A. Binary Code B. Big O Notation C. Moore's Law D. Recursive Function 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
