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.5.md #407

Closed NicolasRoelandt closed 2 years ago

NicolasRoelandt commented 3 years ago

The current solution says that the runtime would increase to O(n^3). But it's already O(n^3), so the asymptotic runtime would not be affected.

walkccc commented 2 years ago

Thank you!