-
-
Notifications
You must be signed in to change notification settings - Fork 1.8k
Much simpler range sum operation #1392
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.
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
base: main
Are you sure you want to change the base?
Conversation
I have provided the overview and implementation of a much simpler range sum query function, which does not require splitting the query. I have explicitly outlined the three cases that may arise while processing a range sum query and the code directly reflects these cases. This implementation is much more beginner friendly and intuitive.
I tend to write segment trees in a similar way but I'm not sure what @adamant-pwn would think. Should this be a diff section or undo the previous? |
Thanks for the pull request! I also prefer this implementation. Moreover, I would also use half-open intervals, rather than segments. The main issue here is that all the other places in the article still use the old style. @Stillswarm would you have some time to also update the remaining sections of the article to use this style? |
@adamant-pwn sure. i will try to refactor as soon as possible |
I have provided the overview and implementation of a much simpler range sum query function, which does not require splitting the original query. I have explicitly outlined the three cases that may arise while processing a range sum query and the code directly reflects these cases. This implementation is much more beginner friendly and intuitive.