Share Your Research, Maximize Your Social Impacts
Efficient Range Minimum Queries using Binary Indexed Trees
Journal: Olympiads in Informatics (Vol.9, No. 1)Publication Date: 2015-08-01
Authors : Mircea DIMA; Rodica CETERCHI;
Page : 39-44
Keywords : binary indexed tree (BIT); least significant non-zero bit (LSB); range minimum query;
Source : Download
Find it from : Google Scholar
Abstract
We present new results on Binary Indexed Trees in order to efficiently solve Range Minimum Queries. We introduce a way of using the Binary Indexed Trees so that we can answer different types of queries, e.g. the range minimum query, in O(logN)time complexity per operation, outperforming in speed similar data structures like Segment/Range Trees or the Sparse Table Algorithm.
Other Latest Articles
- Methodology for Characterization of Cognitive Activities when Solving Programming Problems of an Algorithmic Nature
- Influence of Amino-Ffunctional Macro and Micro Silicone Softeners on the Properties of Cotton Fabric
- Informatics: A Review of Selection Processes, Trainings and Promotion Activities
- Libinteractive: A Better Way to Write Interactive Tasks
- CNEM: Cluster Based Network Evolution Model
Last modified: 2016-01-18 22:43:48