2D Array passing is C++

1. The problem I am having is that I am trying to pass a two dimensional array from my main function to a secondary function. I know it has to be call by reference and using the name of the matrix, "matrix" in my case should send the location. Also since it has more than one dimension there needs to be an inclusion for the number of columns so the function declaration becomes:

float average_depth(float matrix[][6], int size);

where matrix is the matrix memory location, and int size is the total number of elements. From the two lines in my book about this and what I could find online this is the correct declaration for the pointer to the array. But I keep getting an error in the compiling. I have tried restarting Microsoft Visual Studio and reopening my code but it still does not work.

2. I have tried a number of things. Since the error code I keep on getting is an error code that says:

It is a six by six matrix so do I need to have size be 6 or 36. This is of course if I can figure out what is going wrong.

I have tried including the & operator and the * to force the passing of a pointer but that seemed to generate more errors. There is also a copy of the program if you want to look at it. I am sure it is something relatively simple but I have never used a pointer before and am sure that the finer points have been lost on me.

just to tell you how to determine the error : the error is targeting your function implementation...and says the following regarding matrix (hopefully when you compiled with MSVC it would have told you the line)
"subscript requires array or pointer type"... what do you think is subscript refering to in your line of code and what is the array or ptr type its looking for. When you've answered the first question above this shouldbe straight forward.

if at all having problems using [][] passing u can use ** which is the same. Just requires the user to know about what needs to be in the parameter list.

By the way use pointer arithmetic instead of index lookups in calculating the average, that is much more efficient. Likely in this simple case the compiler already optimizes this for you but it is a good program practice to get used to it when it matters.

By the way use pointer arithmetic instead of index lookups in calculating the average, that is much more efficient.

First, he is passing a pointer.

Second, it is a common misperception in C/C++ that ragged arrays are "more efficient" that multi-dimensional arrays. This is untrue. A ragged array,

double ** matrix

requires two index calculations and two pointer references to access an element of the array. A two dimensional array,

double matrix[6][6]

requires one index calculation and one pointer reference to access an element of the array. The index calculation for the multi-dimension array involves integer multiplication while the index calculations for the ragged arrays can be optimized into shifts. However, the pointer references involve memory access. Even if the memory is cached, accessing memory is much much slower than index calculations, which are done with registers. The cost of a double memory access vastly overwhelms the small gain in register-based index calculations.

The primary reason for using ragged arrays over multi-dimensional arrays in C/C++ is that multi-dimensional arrays are one of the weak spots in the language.

Second, it is a common misperception in C/C++ that ragged arrays are "more efficient" that multi-dimensional arrays. This is untrue. A ragged array,

double ** matrix

requires two index calculations and two pointer references to access an element of the array. A two dimensional array,

double matrix[6][6]

requires one index calculation and one pointer reference to access an element of the array. The index calculation for the multi-dimension array involves integer multiplication while the index calculations for the ragged arrays can be optimized into shifts. However, the pointer references involve memory access. Even if the memory is cached, accessing memory is much much slower than index calculations, which are done with registers. The cost of a double memory access vastly overwhelms the small gain in register-based index calculations.

The primary reason for using ragged arrays over multi-dimensional arrays in C/C++ is that multi-dimensional arrays are one of the weak spots in the language.

I think you misunderstand what I am saying.

If someone wants to access or update an array in a sequential fashion there is no point in doing index lookups, just increment a pointer. Much more efficient.

If someone wants to access or update an array in a sequential fashion there is no point in doing index lookups, just increment a pointer. Much more efficient.

Can you provide an example where this true? In all the examples I've tried, I could not get a difference in the assembly between pointer arithmetic and array indexing. Given that array indexing may be less error prone, I'd prefer that. Or are you talking about STL type range algorithms?

int a[#]; for(i=0;i<n;i++) *a++=1; i don't think for(;a++;) will work cuz it iwll just keep accessing contiguous memory addys. and won't terminate though you can try. for(i=n;i;)*a++=1;

I gave "for(i=0; i < n; ++i) *a++ = 1;" a try; gcc 3.2 x86 -O3 gave the same # of instructions as array indexing "for( i = 0; i < n; ++i) a = 1;".

Compilers seem pretty good at seeing this kind of thing. For sure, 2D arrays can be done wrong: I avoid vector<vector> type code for matrices, since the additional indirection does hurt. But how would pointer arithmetic will bail one out of that?