Segment tree can be efficiently and shortly implemented using bitwise operators . Is there any way to implement lazy propagation update operation using bitwise operators (i.e. using no recursive operations) ?
Segment tree can be efficiently and shortly implemented using bitwise operators . Is there any way to implement lazy propagation update operation using bitwise operators (i.e. using no recursive operations) ?
Auto comment: topic has been updated by ahshafi (previous revision, new revision, compare).
Below the heading, lazy propagation on this blog.
Thanks for such amazing suggestion