In the first case we have links(n 1 ) − links(n q ) < links(n 1 ) − links(n q ) and in the second case we have links(n ) < links(n 1 ) − links(n q ).
the smaller chain or fragment is processed earlier than our maximal chain, and by the time our maximal chain is processed, the smaller chain or fragment has already been excised.