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

[PDF DOWNLOAD] AKTU Quantum series data structure b.tech 2nd year download

  All AKTU Quantums are available here. Get your hands on AKTU Quantums and boost your grades in AKTU semester exams. You can either search them category wise or can use the search bar or can manually search on this page. Download aktu second year quantum pdf data structures  download  data structures quantum aktu download aktu data structures quantum click here to download  write in comment section if you want quantum of any other subject.

Root to Leaf Paths | binary tree | geeksforgeeks solution

  Root to Leaf Paths Given a Binary Tree of size N, you need to find all the possible paths from root node to all the leaf node's of the binary tree. Example 1: Input: 1 / \ 2 3 Output: 1 2 #1 3 # Explanation: All possible paths: 1->2 1->3 Example 2: Input:   10   / \   20 30   / \   40 60 Output: 10 20 40 #10 20 60 #10 30 # Your Task: Your task is to complete the function  Paths()  that takes the root node as an argument and return all the possible path. (All the path are printed '#' separated by the driver's code.) Note:  The return type cpp:  vector java:  ArrayList> python:  list of list Expected Time Complexity:  O(N). Expected Auxiliary Space:  O(H). Note:  H is the height of the tree. Constraints: 1<=N<=10 3 Note:  The  Input/Ouput  format and  Example  given, are used for the system'...

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 =...