Question: Explain if the runtime of the function below is O(n2) def adjMat2aDJList(P): adjList = {} for i in range(len(P)): for j in range(len(P[i])): if P[i][j]==
Explain if the runtime of the function below is O(n2)
def adjMat2aDJList(P):
adjList = {}
for i in range(len(P)):
for j in range(len(P[i])):
if P[i][j]== 1:
if i not in adjList.keys():
adjList[i] = []
adjList[i].append(u)
return adjList
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
