GeezerVisonThe World Wide Web, restored to 800 pixels of glory. |
| Home|About|Gaming cabinet|Archives|How it works|Starter sites |
GeezerVison is showing github.com — JavaScript/Trees/FenwickTree.js at master · hackingstaar/JavaScript Expand file tree/ Copy pathFenwickTree.jsMore file actions 36 lines (32 loc) · 742 Bytes / Copy pathFenwickTree.jsFile metadata and controls36 lines (32 loc) · 742 Bytes 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 /* * Author: Mohit Kumar * Fenwick Tree Implementation in JavaScript * Fenwick Tree Implementation for finding prefix sum. */ class FenwickTree { constructor(feneickArray, array, n) { for (let i = 1; i <= n; i++) { feneickArray[i] = 0 } for (let i = 0; i < n; i++) { this.update(feneickArray, n, i, array[i]) } } update(feneickArray, n, index, value) { index = index + 1 while (index <= n) { feneickArray[index] += value index += index & -index } } getPrefixSum(feneickArray, index) { let currSum = 0 index = index + 1 while (index > 0) { currSum += feneickArray[index] index -= index & -index } return currSum } } export { FenwickTree } |
| You are visitor 01402520 — GeezerVison does not store the pages you look up. Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required. |