Skip to main content

how to initilise 2d array in heap memory in c or c++?

greetings my friends , 

lets say we have an two dimensional array of arr[10][20];

   





 int ** arr;

arr = new int*[10] ;          // this means we are initialising memory for 10 pointers  of int type  

for(int i=0 ; i < 10 ; i++)

{

    arr = new int[i][20];                                   //.......................... eqn 1
}

or 

int ** arr;

arr = new int*[10] ;  

for(int i=0 ; i < 10 ; i++)

{

    arr[i] = new int[20];                //  different from one .
}


More explanation : (read it completely )

Ok, let me explain with littile more detail,  lets say we have an array of arr[10][20] . what does it actually means ?

one of the meaning of it is that we have 10 arrays of size of 20 each.  

now i ask you how do you initialise  1-d array?

int *arr;

arr = new int[20];

right ?

that means we require one pointer of int type to initialise an array of size 20 in heap memory.

then how much pointer of int type we require to initialise 10 arrays with each of size 20 ?

yes  you are correct it 10 pointers.

The only difference between initialisation of 1-d array and 2-d array is that in 2-d array the pointer for initialisation of array are also taken in heap memory by using the following instruction.

arr = int*[10];

it means we are initialising 10 pointers in heap memory i.e we give memory to n pointer in heap memory.

these pointers are : arr[0],arr[1] , arr[2] , arr[3] and so on ......

again consider how 1-d array is initialised?

int * t;

t = new int[10].

in place of t we have arr[0] , arr[1], like this .

so we can initialise like this :

for(int i =0 ; i < 10 ; i++)

{

arr[i] = new int [20];
}

another defined way which the compiler understands right is :

for(int i =0 ; i < 10 ; i++)

{

arr = int[i][20];
}


Comments

Popular posts from this blog

leetcode 48 solution

  48 .  Rotate Image You are given an  n x n  2D  matrix  representing an image, rotate the image by  90  degrees (clockwise). You have to rotate the image  in-place , which means you have to modify the input 2D matrix directly.  DO NOT  allocate another 2D matrix and do the rotation.   Example 1: Input: matrix = [[1,2,3],[4,5,6],[7,8,9]] Output: [[7,4,1],[8,5,2],[9,6,3]] Example 2: Input: matrix = [[5,1,9,11],[2,4,8,10],[13,3,6,7],[15,14,12,16]] Output: [[15,13,2,5],[14,3,4,1],[12,6,8,9],[16,7,10,11]]   Constraints: n == matrix.length == matrix[i].length 1 <= n <= 20 -1000 <= matrix[i][j] <= 1000 solution: class Solution { public:     void swap(int& a , int &b)     {         int c ;         c = a;         a = b;         b = c;     }     void transpose (vector<vector<int>...

Regular Expression Matching Leetcode Solution

Regular Expression Matching Given an input string s and a pattern p, implement regular expression matching with support for '.' and '*' where: '.' Matches any single character.​​​​ '*' Matches zero or more of the preceding element. The matching should cover the entire input string (not partial). Example 1: Input: s = "aa", p = "a"  Output: false  Explanation: "a" does not match the entire string "aa". Example 2: Input: s = "aa", p = "a*"  Output: true  Explanation: '*' means zero or more of the preceding element, 'a'. Therefore, by repeating 'a' once, it becomes "aa". Example 3: Input: s = "ab", p = ".*"  Output: true  Explanation: ".*" means "zero or more (*) of any character (.)". Constraints: 1 <= s.length <= 20 1 <= p.length <= 20 s contains only lowercase English letters. p contains only lowercase Englis...

2485. Find the Pivot Integer | Binary search

  Given a positive integer   n , find the   pivot integer   x   such that: The sum of all elements between  1  and  x  inclusively equals the sum of all elements between  x  and  n  inclusively. Return  the pivot integer  x . If no such integer exists, return  -1 . It is guaranteed that there will be at most one pivot index for the given input.   Example 1: Input: n = 8 Output: 6 Explanation: 6 is the pivot integer since: 1 + 2 + 3 + 4 + 5 + 6 = 6 + 7 + 8 = 21. Example 2: Input: n = 1 Output: 1 Explanation: 1 is the pivot integer since: 1 = 1. Example 3: Input: n = 4 Output: -1 Explanation: It can be proved that no such integer exist.   Constraints: 1 <= n <= 1000 Solution : class Solution { publ ic:     int pivotInteger( int n ) {         int sum = (( n )*( n + 1 ))/ 2 ;         int i = 1 ;         int j =...