Arrays, What’s the point?: The first answer to this question is one of the best high-level overviews of data structures I’ve ever seen. It explains.
- Why arrays are 0-based instead of 1-based
- Why arrays have super-fast access times.
- Why arrays have slow search times.
- What Linked Lists are.
- Why Binary Trees are.
- Why Binary Trees can be crazy fast to search.
If you’re a programmer, this is so worth five minutes of your time.