Skip to content
Navigation Menu
Sign in
Products
Platform
GitHub
Repository hosting, code review, and collaboration
Copilot
AI coding agent for tasks, projects, and automated work
Build & Ship
Actions
CI/CD and automation
Code Quality
Quality analysis, fixes, and enforcement
Codespaces
Cloud development environments
Secure
Code Security
Vulnerability detection and remediation
Secret Protection
Secret scanning and leak prevention
All Features
Developers
Learn
Documentation
Training
Certifications
Build
Build with Copilot
Customize Copilot
Integrations
Explore
Trending repos
GitHub Sponsors
Developer articles
Changelog
Changelog
Your source for the latest features, improvements, and fixes across GitHub products, all in one place.
Businesses
By Stage
Enterprises
Team
Startups
Nonprofits
By Industry
Healthcare
Financial services
Manufacturing
Government
See all industries
Evaluate GitHub
Why GitHub
Customer Stories
Business insights
Trust Center
Add-ons
GitHub Advanced Security
Enterprise-grade code security
Copilot for business
Enterprise-grade AI features
Premium Support
Enterprise-grade 24/7 support
Resources
Learn & Connect
Documentation
Resource center
Blog
Events & webinars
Community Forum
Customer Stories
Integrations
Support
Customer support
Training
GitHub Status
Company
About
Partners
Changelog
GitHub Universe
GitHub Universe
The event for developers, by developers — talks, workshops, and what’s next for GitHub.
Pricing
Search
/
Sign in
Sign up
Appearance settings
You signed in with another tab or window.
Reload
to refresh your session.
You signed out in another tab or window.
Reload
to refresh your session.
You switched accounts on another tab or window.
Reload
to refresh your session.
Dismiss alert
{{ message }}
rozza7
ProgrammingHub
Repository navigation
Code
Pull requests
Actions
Projects
Security and quality
Insights
More
items
Files
Expand file tree
main
Breadcrumbs
ProgrammingHub
/
Python
/
binaryIndexedTree.py
Copy path
Blame
More file actions
Blame
More file actions
Latest commit
History
History
History
61 lines (41 loc) · 1.34 KB
main
Breadcrumbs
ProgrammingHub
/
Python
/
binaryIndexedTree.py
Copy path
Top
File metadata and controls
Code
Blame
61 lines (41 loc) · 1.34 KB
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
# Binary Indexed Tree or Fenwick Tree (prefix sum implementation)
def
getsum
(
BITTree
,
i
):
s
=
0
#initialize result
# index in BITree[] is 1 more than the index in arr[]
i
=
i
+
1
# Traverse ancestors of BITree[index]
while
i
>
0
:
# Add current element of BITree to sum
s
+=
BITTree
[
i
]
# Move index to parent node in getSum View
i
-=
i
&
(
-
i
)
return
s
def
updatebit
(
BITTree
,
n
,
i
,
v
):
# index in BITree[] is 1 more than the index in arr[]
i
+=
1
# Traverse all ancestors and add 'val'
while
i
<=
n
:
# Add 'val' to current node of BI Tree
BITTree
[
i
]
+=
v
# Update index to that of parent in update View
i
+=
i
&
(
-
i
)
# Constructs and returns a Binary Indexed Tree for given
# array of size n.
def
construct
(
arr
,
n
):
# Create and initialize BITree[] as 0
BITTree
=
[
0
]
*
(
n
+
1
)
# Store the actual values in BITree[] using update()
for
i
in
range
(
n
):
updatebit
(
BITTree
,
n
,
i
,
arr
[
i
])
# Uncomment below lines to see contents of BITree[]
#for i in range(1,n+1):
# print BITTree[i],
return
BITTree
# Driver code to test above methods
freq
=
[
2
,
1
,
1
,
3
,
2
,
3
,
4
,
5
,
6
,
7
,
8
,
9
]
BITTree
=
construct
(
freq
,
len
(
freq
))
print
(
"Sum of elements in arr[0..5] is "
+
str
(
getsum
(
BITTree
,
5
)))
freq
[
3
]
+=
6
updatebit
(
BITTree
,
len
(
freq
),
3
,
6
)
print
(
"Sum of elements in arr[0..5]"
+
" after update is "
+
str
(
getsum
(
BITTree
,
5
)))
You can’t perform that action at this time.