educative.io

Proof that buildHeap has time complexity of O(N) seems wrong?

∑_{i=0}^∞ i/(2^i) is clearly a diverging series and will not converge to 2. I think there has been a typo somewhere and the series should be ∑_{i=0}^∞ 1/(2^i) instead