Question: If an algorithm runs in quadratic time, what is its time complexity using Big - O ? Group of answer choices O ( log n

If an algorithm runs in quadratic time, what is its time complexity using Big-O?
Group of answer choices
O(log n)
O(1)
O(n)
O(n^2)

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!