Answer from cs61c-eq (Nicholas Hwang 16732453) for Question 2
Because we will cycle through j[0]-j[19] often, we can take advantage of spatial locality. If we retrieve a reasonable sized block, we can go through j[0]-j[19] without accessing main memory to often and accessing data off the cache. Then when we increment i, we can retreive new blocks with needed information for the next loop.