Question: There are running times for two algorithms. T1(n) = 10000n + 10n2 + 1 T2(n) = 30000n2 + 20 - 100n The running time complexity

There are running times for two algorithms.

T1(n) = 10000n + 10n2 + 1

T2(n) = 30000n2 + 20 - 100n

The running time complexity using Big(O) are the same.

*True

*False

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!