hi everyone , this is my first blog post
recently i have read an excellent article about RMQ with BIT , It was thought that BIT is not suitable for solving minimum/maximum query , but this article show how we can solve RMQ with BIT efficiently
The paper show that the Binary Indexed Tree has the following advantages:
-
- Is faster than other data structures that allow the same types of operations.
-
- Can be adapted for a large number of distinct operations: sum, minimum, maximum, greatest common divisor (gcd), greatest common factor (gcf), etc.
-
- Can be extended on multi-core and distributed platforms.
so now i just want to share the link of paper to everyone who is interested in this topic
