(b) Recall the notation ko xk for xo + x₁ + ... + Xp. The processing time for a block of length n > 0 is as follows. • I
Posted: Fri May 27, 2022 8:18 am
(b) Recall the notation ko xk for xo + x₁ + ... + Xp. The processing time for a block of length n > 0 is as follows. • In the case where n = 2p+2 (p > 0) the number of steps is (-_o(8k+12))+2. • In the case where n = 2p+1 (p ≥ 0) the number of steps is (Σ(8k+8))-1. Show that the complexity of M is in O(n²). [8 marks]