[solved] – Question 71355

Of the following statements, which ones can be said to be TRUE?

The time complexity of all single statements is constant

According to the Big O Notation, the time complexity of some statements can be said to be logarithmic

Time complexity can only be expressed by using the Big O notation

Time complexity can be expressed as a differential equation

The time complexity of an algorithm can vary over time

Quadratic time complexity can be expressed as a quadratic equation

Expert Answer

---