I have started reading Introduction to Algorithms by Thomas H Cormen. In Chapter 4, There is sentence that says
Subproblems are not necessarily constrained to being a constant fraction of the original problem size
Can anyone explain this sentence to me. I want to know what do we mean by constant fraction. Thanks