One-Dimensional Arrays in C++

One-Dimensional Arrays in C++

📘 Overview A built-in one-dimensional array in C++ stores a fixed number of elements of the same type in contiguous memory. Elements are accessed by zero-based indices without automatic bounds checking.

🧠 Key Idea An array combines multiple values under one name, with each index selecting a single element. Correct array processing requires valid indices, initialized elements, and explicit tracking of the array's length when passing it to a function.

⚔️ Core Details: - Declaration: int scores[5]; defines an array of five integers with a compile-time constant extent. - Initialization: int scores[5] = {10, 20}; initializes the first two elements to the listed values and the remaining elements to zero. - Indexing: scores[0] accesses the first element; scores[4] accesses the last element of this five-element array. - Bounds safety: accessing an element outside the array's valid index range causes undefined behavior. - Traversal: for (int& score : scores) { score += 1; } visits and modifies every element through a reference. - Function parameters: void process(int values[], int length) receives a pointer rather than a complete array object.

🎯 Why It Matters: - Contiguous storage supports constant-time indexed access and efficient sequential traversal. - Incorrect bounds and uninitialized reads can produce unpredictable results, crashes, or security vulnerabilities. - Understanding array-to-pointer conversion prevents mistakes when passing arrays to functions or calculating their lengths. - Built-in arrays provide a foundation for understanding strings, pointers, std::array, and std::vector.

🧠 Quick Recall: - Valid indices - For an array of length $n$