Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Binary Indexed Tree (Fenwick Tree) #121

Open
kmyk opened this issue Aug 1, 2021 · 0 comments
Open

Binary Indexed Tree (Fenwick Tree) #121

kmyk opened this issue Aug 1, 2021 · 0 comments

Comments

@kmyk
Copy link
Collaborator

kmyk commented Aug 1, 2021 •
edited
Loading

Currently we always use segment trees, but we replace them with binary indexed trees if possible because they have a little bit smaller constant-time factor.
@kmyk kmyk added the good first issue Good for newcomers label Aug 2, 2021
@kmyk kmyk removed the good first issue Good for newcomers label Aug 22, 2021
@kmyk kmyk changed the title セグメント木でなくて Binary Indexed Tree でいいところは Binary Indexed Tree にする Binary Indexed Tree (Fenwick Tree) Sep 9, 2021
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@kmyk