//make an array that is array[sizex][sizey]

int* array = new int[sizex];

//now how make the sizey part?


//and when done, delete

delete [] array;
  

  int* array = new int[sizex][sizey][sizez];  

  int Array[x][y][z];  

quote:Original post by Jason Zelos
A 3 dimensional array.

      int* array = new int[sizex][sizey][sizez];  

  // the linear 2d arrayint *array = new int[sizex*sizey];// access by doingarray[x+y*sizex];delete [] array;//// for a planar multidimensional array// int **array = (int**)(new int[sizey]);for(i=0; i<sizey; i++)   array[i] = new int[sizex];// access byarray[y][x];// deletionfor(i=0; i<sizey; i++)   delete [] array[i];delete [] array;// the c way// linear 2d arrayint *array = (int*)malloc(sizex*sizey);//deletionfree(array);// planar 2d arrayint **array = (int**)(malloc(sizey));for(i=0; i<sizey; i++)   array[i] = (int*)(malloc(sizex));// access byarray[y][x];// deletionfor(i=0; i<sizey; i++)   free(array[i]);free(array);  

    vector< vector<int> > array;  Because I want to use a multidimensioned container of tiles      struct tile{int id;int walk;};  But don't understand how. If the above is right I think I would do      for(i = 0; i < map_width; i++) {  for(j = 0; j < map_height; j++) {    //initialize each tile so I have an    //array of tiles WIDTHxHEIGHT    tile tmp;    tmp.id = 0;    tmp.walk = 1;    map[i].push_back(tmp);  }}  

  int ***number_cube = new (int**)[5];for(int i = 0; i < 5; ++i) {    number_cube[i] = new (int*)[5];    for(int j = 0; j < 5; ++j) {        number_cube[i][j] = new int[5];    }}...for(int i = 0; i < 5; ++i) {    for(int j = 0; j < 5; ++j) {        delete[] number_cube[i][j];    }    delete[] number_cube[i];}delete[] number_cube;  

  struct tile {    int id;    int walk;}; tile TileMap[map_width][map_height];for(i = 0; i < map_width; i++) {      for(j = 0; j < map_height; j++) {         TileMap[i][j].id = 0;          TileMap[i][j].walk = 1;      }}