issues
search
walkccc
/
CLRS
📚 Solutions to Introduction to Algorithms Third Edition
https://walkccc.me/CLRS
MIT License
4.65k
stars
1.26k
forks
source link
Update 15-6.md
#408
Closed
NicolasRoelandt
closed
2 years ago
NicolasRoelandt
commented
3 years ago
Fixing 3 issues:
it should be max, not min, since we want to maximize the conviviality
if we take the grandchildren choice we need to add the node conviviality to the sum
the complexity is O(n) not O(n^2) since each node is visited at most twice
walkccc
commented
2 years ago
Thank you!
Fixing 3 issues: