Join the Teckiy Community
Sign up for Free !!
World's first open source developer community with
Ticketing System
The following recursive code will cause a stack overflow if the array list is too large. How can you fix this and still retain the recursive pattern?
var list = readHugeList();
var nextListItem = function() {
var item = list.pop();
if (item) {
// process the list item...
nextListItem();
}
};
The potential stack overflow can be avoided by modifying the
nextListItemfunction as follows:The stack overflow is eliminated because the event loop handles the recursion, not the call stack. When
nextListItemruns, ifitemis not null, the timeout function (nextListItem) is pushed to the event queue and the function exits, thereby leaving the call stack clear. When the event queue runs its timed-out event, the nextitemis processed and a timer is set to again invokenextListItem. Accordingly, the method is processed from start to finish without a direct recursive call, so the call stack remains clear, regardless of the number of iterations