Skip to main content

2D Array in Cpp (c++)

2D-Array:

2D array is similar to a matrix of mxn (row into column). where every element has a specific index which is usually denoted by i and j. i represent the number of rows and j represent the number of columns.


 

Declaration of 2D Array in C++

int A[5][4];                                               // 5 rows and 4 column

Initialization Of Array:

An array initializer for a 2D array contains the rows of A, separated by commas and enclosed in braces. Each row, in turn, is a list of values separated by commas and enclosed in braces.
int A[5][4] = { 
                     {  1,  2, 3, 4 },
                     { -44, 65, 4, 23},
                     { -45, -1, 3, 34}
                     { -45, -1, 3, 34}
                     { -45, -1, 3, 34}
                  };

There are three-dimensional, four-dimensional, and even higher-dimensional arrays, but they are not used very often in used.

2D array as a pointer:

int **ptr = new int * [row];
 for(x=0;x<row;x++)
 *(ptr+x) = new int [col];

Implementation of 2D Array in C++:

#include<iostream>

using namespace std;

int main()
{

     int row,col,x,y;

    cout<<"Enter number of rows: ";
 cin>>row;

    cout<<"Enter number of columns: ";
 cin>>col;

     int **ptr = new int * [row];


      for(x=0;x<row;x++)

      *(ptr+x) = new int [col]; //Storing elements

       for (x=0;x<row;x++)
       for(y=0;y<col;y++)
       {
             cout<<"Enter number: ";
             cin>>ptr[x][y];
        }

        //Displaying pointer to pointer to ptr

        cout<<"You have entered:"<<endl;

 for (x=0;x<row;x++)
 {
  for(y=0;y<col;y++)
  {
   cout<<ptr[x][y]<<" ";
  }
  cout<<endl;
 }

 return 0;
}

Comments

Popular posts from this blog

Stack Data Structure in Cpp (c++)

  What is Stack? Stack refers to an abstract data types (ADTs) that is a collection of elements, with two principal operations that are addition and removal of elements from the collection. It works on the principle of LIFO (last In first out). It is also considered as a linear data structure.   Example: A set of books. It easy to take an item off the top rather from the middle. Basic operations of Stack: Push: Add item to the list. Pop: Removes item from the list.   Advantages: Stack is faster than heap memory allocation (also known as Dynamic Memory Allocation). Stack memory is automatically reclaimed when the function exits, which can be convenient for the programmer if the data is no longer required. Therefore, it is suitable for temporary data, where memory is not needed after the execution of a function. Implementation Of Stack in C++: #include<iostream> using namespace std; class StackMemory...

Tic-Tac-Toe Implementation in Cpp (C++) Step by Step

Inheritance (OOP)

Inheritance: In object-oriented programming,  inheritance  means an object or class has inherited behaviors from another object  or class. A child class is inherited from parent class. A child inherits characteristics of its parents, besides  inherited characteristics, a child may have its own unique characteristic. . In inheritance, every object of a child class is also an object of parent class, but not vice-versa. Base class: It is the class from which features are to be inherited into another class. Derived class: It is the class in which the base class features are inherited. A derived class can have additional properties and methods not present in the parent class that distinguishes it and provides additional functionality. REAL WORLD EXAMPLE: Let’s consider the Windows operating system. Windows 98 had certain properties and methods that were used in Windows XP. Windows XP was derived from Windows 98, but it was sti...