how to dinamically allocate memory for two dimensional array?

[Pawel_Iks]

Let's consider one dimensional array, which is defined like below:
int N=200;
int *tab=new int[N];
// do something with tab
delete tab;

I'd like to know why can I do the same for two dimensional array.
Please help me.


greetings, Pawel

 

[Kavya]

Let's consider one dimensional array, which is defined like below:
int N=200;
int *tab=new int[N];
// do something with tab
delete tab;

It should be delete[] tab;

I'd like to know why can I do the same for two dimensional array.

int **ptr= new int*[N];
for(int i=0; i<N;++i)
ptr=new int[N];

for(int i=0; i<N;++i)
delete[] ptr;
delete[] ptr;

 

[Daniel T.]

Let's consider one dimensional array, which is defined like below:
int N=200;
int *tab=new int[N];
// do something with tab
delete tab;

I'd like to know why can I do the same for two dimensional array.
Please help me.

Use the Matrix class in the FAQ.
http://www.parashift.com/c++-faq-lite/operator-overloading.html#faq-13.10

 

[White Wolf]

Let's consider one dimensional array, which is defined like below:
int N=200;
int *tab=new int[N];
// do something with tab
delete tab;

That should read:
delete [] tab;

I'd like to know why can I do the same for two dimensional array.

int n=200, m=100;
int *tab=new int[n*m];
// do something with tab
delete []tab;

But I wonder: why don't you use std::vector?

 

[Pawel_Iks]

Thanks for everyone for help ...