4. Suppose algorithm A has time complexity TA(n) = O(n) and algorithm B has time complexity...

 

Transcribed Image Text:

4. Suppose algorithm A has time complexity TA(n) = O(n) and algorithm B has time complexity TB(n) = (n). (a) Which algorithm is generally accepted as "faster" and why? (b) Give an example of two specific running times TA(n) and TB (n) such that algorithm B is faster for 0 n < 10000 and algorithm A is faster for n > 10000 and show why this [5 pts] [10 pts] is the case. Along with your example explain how you came up with it, so don't simply give the example. Both should be valid for all n > 0. 4. Suppose algorithm A has time complexity TA(n) = O(n) and algorithm B has time complexity TB(n) = (n). (a) Which algorithm is generally accepted as "faster" and why? (b) Give an example of two specific running times TA(n) and TB (n) such that algorithm B is faster for 0 n < 10000 and algorithm A is faster for n > 10000 and show why this [5 pts] [10 pts] is the case. Along with your example explain how you came up with it, so don't simply give the example. Both should be valid for all n > 0.