rangeminimum

Documentation

Overview

Package rangeminimum solves exercise 3.10 3-26. b) is solved using two Fenwick trees as discusses in the paper "Efficient Range Minimum Queries using Binary Indexed Trees" Mircea DIMA, Rodica CETERCHI https://ioinformatics.org/journal/v9_2015_39_44.pdf

Index

• func NewBit(values []int) *bit
• func NewNaive(values []int) *naive

Functions

func NewBit

func NewBit(values []int) *bit

Space: O(N) Time: O(N)

func NewNaive

func NewNaive(values []int) *naive

Space: O(N^2) Time: O(N^2)