This article has not yet been rated on Wikipedia's
content assessment scale. It is of interest to the following WikiProjects: | |||||||||||
|
Shouldn't it be possible to do the initial precalculation in O(n) time? (if you build it from bottom upwards, rather than one item at a time) MaZe Pallas ( talk) 19:41, 14 January 2016 (UTC)
I propose merging this article with the article on prefix sums by adding a section on Fenwick trees to said article.
Andrew Helwer ( talk) 21:13, 9 April 2012 (UTC)
I have no idea why someone replaced the perfectly apt example at https://en.wikipedia.org/?title=Fenwick_tree&oldid=736899871 with the current enormously bloated code at https://en.wikipedia.org/?title=Fenwick_tree&oldid=805301708 that contains a ton of irrelevant stuff. I don't want to start an edit war, so can we vote to revert it? 185.31.142.251 ( talk) 17:50, 17 November 2017 (UTC)
Is the animation presented even a binary indexed tree? It's certainly not a binary tree which is how the array implicit tree works.
Wqwt ( talk) 13:46, 21 August 2019 (UTC)
See https://www.fcodelabs.com/2019/03/18/Sum-Tree-Introduction/
I have not really dived into either of the concepts, but they seem strongly related at first glance. 2001:700:300:4221:3916:6608:BE75:CB88 ( talk) 08:49, 13 September 2019 (UTC)
In the comments to the C implementation, `i & (-i)` is described as the least significant bit which, based on the linked description should instead be computed as `i & 1`. I understand that instead returns the least significant bit that has value of 1. I corrected the comment to reflect that. Matteodellamico ( talk) 08:07, 21 April 2022 (UTC)
range_sum returns the sum from i+1 to j so get(i) would return the i+1th element, so its basically -1 indexed — Preceding unsigned comment added by Ymensss ( talk • contribs) 15:26, 6 June 2022 (UTC)
I rarely have anything but nitpicks with wiki articles but this one is just terrible. It gives no intuition of how it works, and the section < /info/en/?search=Fenwick_tree#Updating_and_querying_the_tree> well, I've read it several times over and I have no idea of what it's saying. It just makes no sense to me. Even the comments are baffling 79.79.245.61 ( talk) 09:06, 19 July 2022 (UTC)
This article has not yet been rated on Wikipedia's
content assessment scale. It is of interest to the following WikiProjects: | |||||||||||
|
Shouldn't it be possible to do the initial precalculation in O(n) time? (if you build it from bottom upwards, rather than one item at a time) MaZe Pallas ( talk) 19:41, 14 January 2016 (UTC)
I propose merging this article with the article on prefix sums by adding a section on Fenwick trees to said article.
Andrew Helwer ( talk) 21:13, 9 April 2012 (UTC)
I have no idea why someone replaced the perfectly apt example at https://en.wikipedia.org/?title=Fenwick_tree&oldid=736899871 with the current enormously bloated code at https://en.wikipedia.org/?title=Fenwick_tree&oldid=805301708 that contains a ton of irrelevant stuff. I don't want to start an edit war, so can we vote to revert it? 185.31.142.251 ( talk) 17:50, 17 November 2017 (UTC)
Is the animation presented even a binary indexed tree? It's certainly not a binary tree which is how the array implicit tree works.
Wqwt ( talk) 13:46, 21 August 2019 (UTC)
See https://www.fcodelabs.com/2019/03/18/Sum-Tree-Introduction/
I have not really dived into either of the concepts, but they seem strongly related at first glance. 2001:700:300:4221:3916:6608:BE75:CB88 ( talk) 08:49, 13 September 2019 (UTC)
In the comments to the C implementation, `i & (-i)` is described as the least significant bit which, based on the linked description should instead be computed as `i & 1`. I understand that instead returns the least significant bit that has value of 1. I corrected the comment to reflect that. Matteodellamico ( talk) 08:07, 21 April 2022 (UTC)
range_sum returns the sum from i+1 to j so get(i) would return the i+1th element, so its basically -1 indexed — Preceding unsigned comment added by Ymensss ( talk • contribs) 15:26, 6 June 2022 (UTC)
I rarely have anything but nitpicks with wiki articles but this one is just terrible. It gives no intuition of how it works, and the section < /info/en/?search=Fenwick_tree#Updating_and_querying_the_tree> well, I've read it several times over and I have no idea of what it's saying. It just makes no sense to me. Even the comments are baffling 79.79.245.61 ( talk) 09:06, 19 July 2022 (UTC)