Postgraduate Computer Science 408 analysis 65: Which statement best describes algorithm complexity? Focus on programming in this variation.

A. Big-O notation describes how resource use grows with input size B. Big-O applies only to graphics C. Big-O gives the exact running time on every computer D. Input size cannot affect complexity