Let N be the length of nums. The following code is O(N**2). What optimization would make...

 

Transcribed Image Text:

Let N be the length of nums. The following code is O(N**2). What optimization would make it be O(N)? nums... # hidden def avg(values): return sum(values) / len(values) big_nums = [] total = sum(nums) # line A count = len(nums) # line B for x in nums: if x > sum(nums) / len(nums): # line C big_nums.append(x) # line D Let N be the length of nums. The following code is O(N**2). What optimization would make it be O(N)? nums... # hidden def avg(values): return sum(values) / len(values) big_nums = [] total = sum(nums) # line A count = len(nums) # line B for x in nums: if x > sum(nums) / len(nums): # line C big_nums.append(x) # line D

Answer rating: 100% (QA)

To optimize the given code from ON2 to ON you can calculate the average ... View the full answer