I was reading 2D BIT, gfg implementation https://www.geeksforgeeks.org/two-dimensional-binary-indexed-tree-or-fenwick-tree/ Please help me with some doubts, In the updateBit and getSum function inner "y" loop is not initialized again. Is it a mistake or is it meant to be that way?
iiTsnhetiensncoesnditicynogadtcineanagcbcheapnixbeel vwieitwhveiidteswaeseidgahatrtsananetsirfgaohnrmbsfooarrtsmioaanntidoofnetohnfecotihdnepiniungtpitumhteiamgineafgionertmiontaaotniaoLnnBLiPBnPiaminmag8a-egbeaitsasisnhsthoeowgwenrnivninaFlFuiigegu.urTreeh9is. encoding can be viewed as a ...