INNER CODE UNIT · Python
b
lschoe/mpyc · demos/PrefixOrExplained.py:432
b = x[h-1]
if i:
x[h-1] = x[i-1] | b
pf(h, j)
x[j-1] = b | x[j-1]
n = len(x)
x = x[:]
pf(0, n)
return x
# In[27]:
correctness(prefix_or9)
complexity(prefix_or9, 1)
complexity(prefix_or9, 2)