I guess the best way to explain this question is by iterating over a linked list vs array.
Given an array and linked list of size n purely based on time it takes to move to a different memory address would iterating through an array be any faster than iterating through a linked list. As arrays are a continuous block of memory and linked lists contain pointers to other spots in memory, would an array be any faster? If it was a large enough amount of memory would there be any noticeable difference in speed?
Thanks for any input!