1. Consider the following function. def q1(L): n = len(L) count = 0 for i in...

 

Transcribed Image Text:

1. Consider the following function. def q1(L): n = len(L) count = 0 for i in L: if i max (L) or i < 0: == count return count count + 1 a. What is the Big-O running time bound for ql in terms of n, where n == len(L)? 1. Consider the following function. def q1(L): n = len(L) count = 0 for i in L: if i max (L) or i < 0: == count return count count + 1 a. What is the Big-O running time bound for ql in terms of n, where n == len(L)?

Answer rating: 100% (QA)

To analyze the BigO running time bound for the function q1 in terms of n where n lenL lets bre... View the full answer