1. Indicate whether f = O(g), f = (g), or f = e(g). f = n0,...

Transcribed Image Text:

1. Indicate whether f = O(g), f = (g), or f = e(g). f = n¹0, g=n20 •f=2", g = (3/2)" ● f = 10₂(n), g=nlog, (10) • f = √2¹02 (m) 9= √n 2. Determine the big-O complexity of func1 in terms of M and N. A and B are M length and N length arrays respectively. def func1 (A,B,M,N): buildMaxHeap (B) for i in range (M): j = N while j> 0: Algorithm 1: func1 B[j] = A[i]+j+i j= floor (j/ 10) 1. Indicate whether f = O(g), f = (g), or f = e(g). f = n¹0, g=n20 •f=2", g = (3/2)" ● f = 10₂(n), g=nlog, (10) • f = √2¹02 (m) 9= √n 2. Determine the big-O complexity of func1 in terms of M and N. A and B are M length and N length arrays respectively. def func1 (A,B,M,N): buildMaxHeap (B) for i in range (M): j = N while j> 0: Algorithm 1: func1 B[j] = A[i]+j+i j= floor (j/ 10)

Answer rating: 100% (QA)

For the functions fn10 and gn20 we have fOg because n10 grows slower than ... View the full answer