mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2024-10-05 21:29:29 +00:00
Code Issues Packages Projects Releases Wiki Activity

Merge e12456ddc4 into fcf82a1eda

Browse Source
This commit is contained in:
Andrey Ivanov 2024-10-05 14:07:29 -05:00 committed by GitHub
commit 1cccfb4cc4
No known key found for this signature in database
GPG Key ID: B5690EEEBB952194
1 changed files with 8 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

11
dynamic_programming/optimal_binary_search_tree.py
View File

@ -115,9 +115,14 @@ def find_optimal_binary_search_tree(nodes):
dp[i][j] = sys.maxsize # set the value to "infinity"
total[i][j] = total[i][j - 1] + freqs[j]
# Apply Knuth's optimization
# Loop without optimization: for r in range(i, j + 1):
for r in range(root[i][j - 1], root[i + 1][j] + 1): # r is a temporal root
# Apply Knuth's optimization with boundary checking
r_start = max(i, root[i][j - 1] if j > i else i)
r_end = min(j, root[i + 1][j] if i < j else j)
if r_start > r_end:
r_start, r_end = i, j # fall back to the full range
for r in range(r_start, r_end + 1):
left = dp[i][r - 1] if r != i else 0 # optimal cost for left subtree
right = dp[r + 1][j] if r != j else 0 # optimal cost for right subtree
cost = left + total[i][j] + right