Suppose that an algorithm A runs in the worst case with time f(n) and algorithm B...

 

Transcribed Image Text:

Suppose that an algorithm A runs in the worst case with time f(n) and algorithm B takes time g(n), in the worst case. Answer the following questions with yes, no or maybe and formally justify your answer. Is B faster than A, for all n greater than some no... a). If g (n) b) If g (n) (f (n) log n)? (f (n) log n)? Suppose that an algorithm A runs in the worst case with time f(n) and algorithm B takes time g(n), in the worst case. Answer the following questions with yes, no or maybe and formally justify your answer. Is B faster than A, for all n greater than some no... a). If g (n) b) If g (n) (f (n) log n)? (f (n) log n)?