Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

[Oops.] Optimal Binary Search Tree, recurrence #299

Open
Heuzi opened this issue Oct 8, 2024 · 0 comments
Open

[Oops.] Optimal Binary Search Tree, recurrence #299

Heuzi opened this issue Oct 8, 2024 · 0 comments

Comments

@Heuzi
Copy link

Heuzi commented Oct 8, 2024

Please verify that the error is present in the most recent revision before reporting.
Yes, the error is found on the recently downloaded PDF version and book version
Chapter number or note title: [title]
2.8 Optimal Binary Search Trees
Page number: [page]
page 92
Error description: [error]
Screenshot 2024-10-08 090949

Suggested fix (if any): [fix]
f[i] should be replaced with f[j].

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant