Code:#include <iostream> using namespace std; int HighestTemp(int**, const int, const int); int HighestTemp(int** temp, const int row, const int col) { int highest = 0; for (int i=0; i<row; i++) { for (int j=0; j<col; j++) { if((int)*(temp+i*col+j) > highest) { highest = (int)*(temp+i*col+j); } } } return highest; } int main() { int temp[3][3]={1,2,3,4,5,6,7,8,9}; int h=HighestTemp((int**)temp, 3, 3); cout << h << endl; return 0; }
> int HighestTemp(int**, const int, const int);
Change this to
int HighestTemp( int(*)[3], const int, const int);
> int HighestTemp(int** temp, const int row, const int col)
int HighestTemp(int (*temp)[3], const int row, const int col)
> if((int)*(temp+i*col+j) > highest)
To
if( temp[i][j] ) > highest)
And
> int h=HighestTemp((int**)temp, 3, 3);
to
int h=HighestTemp(temp, 3, 3);
If you dance barefoot on the broken glass of undefined behaviour, you've got to expect the occasional cut.
If at first you don't succeed, try writing your phone number on the exam paper.
Arrays and pointers are _not_ the same. The bare name of the 2d array _decays_ into a pointer to array(s) of 3 ints each: int (*)[3]. This cannot be simply converted to int **. It is something completely different.Originally Posted by gunitinug
I strongly recommend you to read the "Arrays and pointers" section of the C FAQ: Arrays and Pointers
Besides, this forum has some wonderful documents that explain how to ask questions... ;-)
Please don't use horrible code like this. It's so easy to make mistakes, it looks ugly, it's hard to maintain, and you have to deal with pointers.
Just make your life easier, use
std::vector<std::vector<T>> v(N, std::vector<T>(M));
Where T is your type, N is size of the first dimension and M is the size of the second dimension. It would look something like
T array[N][M];
if written as a fixed array.
And please ask an actual question next time.
