Essential Books

A fixed size raw array matrix that is a 2D raw array

suggest change 
// A fixed size raw array matrix (that is, a 2D raw array).
#include <iostream>
#include <iomanip>
using namespace std;

auto main() -> int
{
    int const   n_rows  = 3;
    int const   n_cols  = 7;
    int const   m[n_rows][n_cols] =             // A raw array matrix.
    {
        {  1,  2,  3,  4,  5,  6,  7 },
        {  8,  9, 10, 11, 12, 13, 14 },
        { 15, 16, 17, 18, 19, 20, 21 }
    };
    
    for( int y = 0; y < n_rows; ++y )
    {
        for( int x = 0; x < n_cols; ++x )
        {
            cout << setw( 4 ) << m[y][x];       // Note: do NOT use m[y,x]!
        }
        cout << '\n';
    }
}
try online 
   1   2   3   4   5   6   7
   8   9  10  11  12  13  14
  15  16  17  18  19  20  21

C++ doesn’t support special syntax for indexing a multi-dimensional array. Instead such an array is viewed as an array of arrays (possibly of arrays, and so on), and the ordinary single index notation [i\] is used for each level. In the example above m[y] refers to row y of m, where y is a zero-based index. Then this row can be indexed in turn, e.g. m[y], which refers to the xth item – or column – of row y.

I.e. the last index varies fastest, and in the declaration the range of this index, which here is the number of columns per row, is the last and “innermost” size specified.

Since C++ doesn’t provide built-in support for dynamic size arrays, other than dynamic allocation, a dynamic size matrix is often implemented as a class. Then the raw array matrix indexing notation m[y] has some cost, either by exposing the implementation (so that e.g. a view of a transposed matrix becomes practically impossible) or by adding some overhead and slight inconvenience when it’s done by returning a proxy object from operator[]. And so the indexing notation for such an abstraction can and will usually be different, both in look-and-feel and in the order of indices, e.g. m(x,y) or m.at(x,y) or m.item(x,y).

Found a mistake? Have a question or improvement idea? Let me know.

Feedback about page:

Feedback:
Optional: your email if you want me to get back to you:

Arrays:
* Array initialization
* A fixed size raw array matrix that is a 2D raw array
* Dynamically sized raw array
* Array size type safe at compile time
* Expanding dynamic size array by using std::vector
* Dynamic size matrix using std::vector for storage
Table Of Contents
0 Getting started
1 Literals
2 Basic type keywords
3 Operator precedence
4 Floating point arithmetic
5 Bit operators
6 Bit manipulation
7 Bit fields
8 Arrays
9 Flow control
10 const keyword
11 Loops
12 mutable keyword
13 friend keyword
14 keywords
15 Variable declaration keywords
16 auto keyword
17 Pointers
18 Type keywords (class, enum, struct, union)
19 Classes / structs
20 std::string
21 Enumeration
22 std::atomic
23 std::vector
24 std::array
25 std::pair
26 std::map
27 std::unordered_map
28 std::set and std::multiset
29 std::any
30 std::variant
31 std::optional
32 std::integer_sequence
33 std::function
34 std::forward_list
35 std::iomanip
36 Iterators
37 Basic I/O
38 File I/O
39 Streams
40 Stream manipulators
41 Metaprogramming
42 Returning multiple values from a function
43 References
44 Polymorphism
45 Value and reference semantics
46 Function call by value vs. by reference
47 Copying vs assignment
48 Pointers to class / struct members
49 The this pointer
50 Smart pointers
51 Unions
52 Templates
53 Namespaces
54 Function overloading
55 Operator overloading
56 Lambdas
57 Threading
58 Value categories
59 Preprocessor
60 SFINAE
61 Rule of three, five and zero
62 RAII
63 Exceptions
64 Implementation-defined behavior
65 Special member functions
66 Random numbers
67 Sorting
68 Regular expressions
69 Perfect forwarding
70 Virtual member functions
71 Undefined behavior
72 Overload resolution
73 Move semantics
74 Pimpl idiom
75 Copy elision
76 Fold expressions
77 Unnamed types
78 Singleton
79 ISO C++ Standard
80 User-defined literals
81 Type erasure
82 Memory management
83 Explicit type conversions
84 RTTI
85 Standard library algorithms
86 Expression templates
87 Scopes
88 Atomic types
89 static assert
90 constexpr
91 Date and time with std::chrono
92 Trailing return type
93 Function template overloading
94 Common compile linker errors
95 Design patterns
96 Optimizations
97 Compiling and building
98 Type traits
99 One definition rule
100 Unspecified behavio
101 Argument dependent name lookup
102 Attributes
103 Internationalization
104 Profiling
105 Return type covariance
106 Non-static member functions
107 Recursion
108 Callable objects
109 Constant class member functions
110 C++ vs. C++ 11 vs C++ 17
111 Inline functions
112 Client server examples
113 Header files
114 Const correctness
115 Refactoring techniques
116 Parameter packs
117 Iteration
118 type deduction
119 C++ 11 memory model
120 Build systems
121 Concurrency with OpenMP
122 Type inference
123 Resource management
124 Storage class specifiers
125 Alignment
126 Inline variables
127 Linkage specifications
128 Curiusly recurring template pattern
129 Using declaration
130 Typedef and type aliases
131 Layout of object types
132 C incompatibilities
133 Optimization
134 Semaphore
135 Thread synchronization
136 Debugging
137 Futures and promises
138 More undefined behaviors
139 Mutexes
140 Recursive mutex
141 Unit testing
142 decltype
143 Digit separators
144 C++ Containers
145 Arithmetic meta-programming
146 Contributors