Assume that for some list implementation, a pointer requires P bytes and a data object requires D bytes. Type a fraction (like "1/2") to show how full the array should be for the break even point, that is, the point beyond which the array-based list implementation needs less space than the linked list implementation. Give your fraction in lowest terms.
ANS
The overhead is P and the total space needed is SUM.
As the array fills up, its overhead decreases.
The pointer space (P bytes) is overhead.
The bigger the overhead fraction, the less the array needs to be better. The bigger the data field, the more the array needs to be better.
The break-even point is at D/SUM.
If you have values like 4/8, reduce to 1/2.