search

walkccc / CLRS

📚 Solutions to Introduction to Algorithms Third Edition
https://walkccc.me/CLRS
MIT License
4.69k stars 1.26k forks source link

Update 2-1.md #468

Closed ajay-ghub closed 1 year ago

ajay-ghub commented 1 year ago

Current statement is confusing because we won't be comparing n elements in 'each step'. If we visualize the merging as a tree, then we can say that we will be comparing n elements in each 'level'.

walkccc commented 1 year ago

Thank you!