I was studying in depth about pointers as I don't think I have good knowledge about pointers and came across the following line on Wikipedia:
When dealing with arrays, the critical lookup operation typically involves a stage called address calculation which involves constructing a pointer to the desired data element in the array. If the data elements in the array have lengths that are divisible by powers of two, this arithmetic is usually much more efficient.
Why is this so?