It doesn't need to be contiguous. Modern computers use something called "paging". So while the physical address of the memory isn't contiguous, the virtual addresses given to the program is...
Type: Posts; User: helloworld922
It doesn't need to be contiguous. Modern computers use something called "paging". So while the physical address of the memory isn't contiguous, the virtual addresses given to the program is...
I've used 2D ArrayLists to store a graph before. I'm sure you could find a use for 2D LinkedLists, but I've never personally had to do that. Instead, I usually prefer to use some kind of a tree (BSP,...