Memory & arrays - 2d array to simulate linked list for stack construction

Original - c++ Code #include <iostream> using namespace std; int myTop, index, nex = -1; int twoDimentionalArray[25][3], L[25]; void construction(int twodimention[25][3], int list[25]) { myTop = -1; for(int p=0; p<25;p++) twoDimentionalArray[p][2] = -1; } void empty() { if (myTop == -1) cout << "The stack is empty."; else cout << "The stack is not empty."; } void push(int value) { if (myTop < 24) { myTop++; L[myTop] = value; index = rand()%25; twoDimentionalArray[index][0] = index; twoDimentionalArray[index][1] = value; twoDimentionalArray[index][2] = nex; nex = index; } else cout << "The stack is full."; } void top() { if (myTop != -1) cout << "The top of stack value is: " << L[myTop]; else cout << "The stack is empty."; cout << endl; } void pop() { if (myTop != -1) { myTop --; twoDimentionalArray[index][2] = -1; } } void display() { for (int row=0; row<25; row++) { for (int column=0; column<3; column++) { cout << twoDimentionalArray[row][column] << "\t"; if (column == 2) cout << endl; } } cout << endl; } int main() { construction(twoDimentionalArray, L); for (int i=0; i < 11; i++) push(i); display(); system ("pause"); }

#include <iostream>
using namespace std;
 
int myTop, index, nex = -1;
int twoDimentionalArray[25][3], L[25];
 
void construction(int twodimention[25][3], int list[25])
{
    myTop = -1;
    for(int p=0; p<25;p++)
        twoDimentionalArray[p][2] = -1;
}
 
void empty()
{
    if (myTop == -1)
        cout << "The stack is empty.";
    else
        cout << "The stack is not empty.";
}
 
void push(int value)
{
    if (myTop < 24)
    {   
        myTop++;
        L[myTop] = value;
        index = rand()%25;
        twoDimentionalArray[index][0] = index;
        twoDimentionalArray[index][1] = value;
        twoDimentionalArray[index][2] = nex;
        nex = index;
    }
    else
        cout << "The stack is full.";       
}
 
void top()
{
    if (myTop != -1)
        cout << "The top of stack value is: " << L[myTop];
    else
        cout << "The stack is empty.";
    cout << endl;
}
 
void pop()
{
    if (myTop != -1)
    {
        myTop --;
        twoDimentionalArray[index][2] = -1;
    }
 
}
 
void display()
{
    for (int row=0; row<25; row++)
    {
        for (int column=0; column<3; column++)
        {
            cout << twoDimentionalArray[row][column] << "\t";
            if (column == 2)
                cout << endl;
        }
    }
    cout << endl;
}
 
int main()
{
    construction(twoDimentionalArray, L);
    for (int i=0; i < 11; i++)
        push(i);
    display();
 
    system ("pause");
}