Why 2^n and not n!: The Algorithm Design Manual: 1.2 Selecting the Right Job (page 10) : <p>land,</p>

<p>In the section (page 10), the author willingly used 2-power-n to try all possible combinations of sub-intervals to find the largest subset that contains the maximum number of non-overlapping jobs. I was thinking n! instead and hence couldn't get his logic to use rather 2-power-n. Kindly please help me right here.</p>

<p>Thanks.</p>
