Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Showing content from https://TheAlgorithms.github.io/C-Plus-Plus/d6/d2e/fenwick__tree_8cpp_source.html below:

TheAlgorithms/C++: range_queries/fenwick_tree.cpp Source File

std::vector<int>

{};

(

x) {

(x & (-x)); }

<

T>

.assign(

+ 1, 0);

(

i = 0; i <

; ++i) {

<

T>

<

T>

<

T>

std::vector<int> arr = {1, 2, 3, 4, 5};

assert(fenwick_tree.

(0, 0) == 1);

assert(fenwick_tree.

(0, 1) == 3);

assert(fenwick_tree.

(0, 2) == 6);

assert(fenwick_tree.

(0, 3) == 10);

assert(fenwick_tree.

(0, 4) == 15);

fenwick_tree.

(0, 6);

std::cout <<

;

The class that initializes the Fenwick Tree.

int sum_range(int l, int r)

Returns the prefix sum in range from L to R.

void update(T id, T val)

Updates the value of an element in original array and accordingly updates the values in BIT array.

int sum(T id)

Returns the sum of elements in range from 0 to ID.

fenwick_tree(const std::vector< T > &arr)

Class Constructor.

int offset(int x)

Returns the highest power of two which is not more than x.

fenwick_tree(T x)

Class Constructor.

std::vector< int > bit

Array that represents Binary Indexed Tree.

size_t n

No. of elements present in input array.

static void tests()

Self-test implementations.

int main()

Main function.

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4