-
Notifications
You must be signed in to change notification settings - Fork 0
Supports minimum and maximum queries (but not both, although one could make two RMQ's) in log(n) time. The build time is O(n). It should be noted that there is a way to achieve O(1) time using a data structure similar to segment trees...
jcarlson212/RMQSegTree
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
About
Supports minimum and maximum queries (but not both, although one could make two RMQ's) in log(n) time. The build time is O(n). It should be noted that there is a way to achieve O(1) time using a data structure similar to segment trees...
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published