We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 60e1a07 commit 01be1eaCopy full SHA for 01be1ea
data_structures/arrays/sparse_table.py
@@ -1,9 +1,9 @@
1
"""
2
Sparse table is a data structure that allows answering range queries on
3
- a static number_listay, i.e. the elements do not change throughout all the queries.
+ a static number list, i.e. the elements do not change throughout all the queries.
4
5
The implementation below will solve the problem of Range Minimum Query:
6
- Finding the minimum value of a subset [L..R] of a static number_listay.
+ Finding the minimum value of a subset [L..R] of a static number list.
7
8
Overall time complexity: O(nlogn)
9
Overall space complexity: O(nlogn)
0 commit comments