Query regarding binary indexed tree (or Fenwick Tree)

Правка en1, от ivplay, 2019-08-23 15:17:06

What is the proof that from any index idx , idx + (idx&-idx) is the next closest index that covers idx? I mean how can I prove that no other index in range ( idx,idx+(idx&-idx) ) actually covers idx? '(' means exclusive and covers idx means contains information of idx ??

Thanks in advance.

Теги advanced data structure, binary indexed tree, proof

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский ivplay 2019-08-23 15:17:06 346 Initial revision (published)