#stride-access
Wiki
›
Algorithms
›
02. Data Structures
›
1. Core Data Structures and Operations
›
1.1 Arrays and Dynamic Arrays
›
Stride Access
Array Stride Access Array stride access visits elements with a fixed step between consecutive indices. A stride of $1$ scans every element. Larger strides skip elements and may reduce cache locality. You use it when data is sampled, stored in interleaved form, or traversed by columns in row-major storage. Problem Given an array $A$ of length $n$ and a stride $s$, process indices: $$ 0, s, 2s, 3s, \dots $$...