Find the running time equation of the following algorithm. You don't have to find its complexity....

   

Transcribed Image Text:

Find the running time equation of the following algorithm. You don't have to find its complexity. Just determine the running time equation, T(n). In [1]: def algol (L): if len (L) <= 1: return 1 for x in L: for y in L: S += x*y s += 5* (x+y) for i in range (len (L)//2): L.pop(i) return s algol (L) Find the running time equation of the following algorithm. You don't have to find its complexity. Just determine the running time equation, T(n). In [1]: def algol (L): if len (L) <= 1: return 1 for x in L: for y in L: S += x*y s += 5* (x+y) for i in range (len (L)//2): L.pop(i) return s algol (L)

Answer rating: 100% (QA)

The image presents a Python function algo1L that takes a list L a... View the full answer