Why global array has a larger size than the local array?
Last Updated :
23 Jul, 2025
An array in any programming language is a collection of similar data items stored at contiguous memory locations and elements can be accessed randomly using array indices. It can be used to store the collection of primitive data types such as int, float, double, char, etc of any particular type. For example, an array in C/C++ can store derived data types such as structures, pointers, etc. Below is the representation of an array.

The arrays can be declared and initialized globally as well as locally(i.e., in the particular scope of the program) in the program. Below are examples to understand this concept better.
Program 1: Below is the C++ program where a 1D array of size 107 is declared locally.
C++
// C++ program to declare the array
// of size 10^7 locally
#include <bits/stdc++.h>
using namespace std;
// Driver Code
int main()
{
const int N = 1e7;
// Initialize the array a[]
int a[N];
a[0] = 1;
cout << a[0];
return 0;
}
Java
// Java program to declare the array
// of size 10^5 locally
import java.io.*;
class GFG{
// Driver code
public static void main(String[] arg)
{
int N = (int)1e7;
// Declare array a[]
int a[] = {N};
a[0] = 1;
System.out.print(a[0]);
}
}
Python
# Python program to declare the array
# of size 10^5 locally
# Driver Code
if __name__ == "__main__":
# Define the size of the array
N = 10**5
# Initialize the array a[]
a = [0] * N
a[0] = 1
# Print the first element of the array
print(a[0])
C#
using System;
class Program {
static void Main()
{
const int N = 10000000;
// Initialize the array a[]
int[] a = new int[N];
a[0] = 1;
Console.WriteLine(a[0]);
}
}
JavaScript
// JavaScript program to declare the array
// of size 10^5 locally
// Driver code
function main() {
const N = 1e7;
// Declare array a[]
const a = new Array(N);
a[0] = 1;
console.log(a[0]);
}
// Calling the main function
main();
Output:

Explanation: In the above program, a segmentation fault error occurs when a 1-D array is declared locally, then the limit of that array size is the order of 105. It is not possible to declare the size of the array as more than 105. In this example, the array of size 107 is declared, hence an error has occurred.
Program 2: Below is the program where a 1-D array of size 105 is initialized:
C++
// C++ program to declare the array
// of size 10^5 locally
#include <bits/stdc++.h>
using namespace std;
// Driver code
int main()
{
const int N = 1e5;
// Declare array a[]
int a[N];
a[0] = 1;
cout << a[0];
return 0;
}
Java
// Java program to declare the array
// of size 10^5 locally
import java.io.*;
class GFG{
// Driver code
public static void main(String[] arg)
{
int N = 1;
// Declare array a[]
int a[] = {N};
a[0] = 1;
System.out.print(a[0]);
}
}
// This code is contributed by shivani
Python3
# Python program to declare the array
# of size 10^5 locally
# Driver code
N = 1e5
# Declare array a[]
a = [N]
a[0] = 1
print(a[0])
# This code is contributed by shivanisinghss2110
C#
// C# program to declare the array
// of size 10^5 locally
using System;
class GFG
{
// Driver code
public static void Main(String[] arg)
{
int N = 1;
// Declare array a[]
int []a = {N};
a[0] = 1;
Console.Write(a[0]);
}
}
// This code is contributed by shivanisinghss2110
JavaScript
<script>
// Javascript program to declare the array
// of size 10^5 locally
var N = 1;
// Declare array a[]
var a = [N];
a[0] = 1;
document.write(a[0]);
// This code is contributed by shivani
</script>
Explanation: In the above program, the code compilation is successful, and the output is 1. This is because the 1D array of size 105 is initialized locally and this is valid.
Program 3: Below is the program where a 1-D array of size 107 is declared globally.
C++
// C++ program to declare the array
// of size 10^7 globally
#include <bits/stdc++.h>
using namespace std;
// Variable N is initialized
const int N = 1e7;
// Global array is declared
int a[N];
// Driver Code
int main()
{
a[0] = 1;
cout << a[0];
return 0;
}
Java
// Java program to declare the array
// of size 10^7 globally
import java.io.*;
class GFG
{
// Driver Code
public static void main(String[] arg)
{
// Variable N is initialized
int N = 1;
// Global array is declared
int a[] = {N};
a[0] = 1;
System.out.print(a[0]);
}
}
// this code is contributed by shivani
Python3
# Python3 program to declare the array
# of size 10^7 globally
# Variable N is initialized
N = 1e7
# Global array is declared
a = [N]
# Driver Code
a[0] = 1
print(a[0])
# This code is contributed by shivanisinghss2110
C#
// C# program to declare the array
// of size 10^7 globally
using System;
class GFG
{
// Driver Code
public static void Main(String[] arg)
{
// Variable N is initialized
int N = 1;
// Global array is declared
int []a = {N};
a[0] = 1;
Console.Write(a[0]);
}
}
// this code is contributed by shivanisinghss2110
JavaScript
<script>
// Javascript program to declare the array
// of size 10^7 globally
// Variable N is initialized
const N = 1e7;
// Global array is declared
let a = new Array(N);
// Driver Code
a[0] = 1;
document.write(a[0]);
// This code is contributed by gfgking.
</script>
Explanation: In the above code compilation is successful, and the output is 1. This is because a 1-D array of size 107 is declared globally and this is valid.
Note: If a 1-D array of size 108 is declared globally, then again the segmentation fault error will be encountered because there is also a limit for global declaration of the 1-D array and that is, it is possible to only declare a 1-D array globally up to 107 sizes.
Why global array has a larger size than the local array?
- When an array is declared locally, then it always initializes in the stack memory, and generally, stack memory has a size limit of around 8 MB. This size can vary according to different computer architecture.
- When an array is declared globally then it stores in the data segment, and the data segment has no size limit. Hence, when the array is declared of big size (i.e., more than 107) then the stack memory gets full and leads into the stack overflow error, and therefore, a segmentation fault error is encountered. Therefore, for declaring the array of larger size, it is good practice to declare it globally.
Similar Reads
Basics & Prerequisites
Data Structures
Array Data StructureIn this article, we introduce array, implementation in different popular languages, its basic operations and commonly seen problems / interview questions. An array stores items (in case of C/C++ and Java Primitive Arrays) or their references (in case of Python, JS, Java Non-Primitive) at contiguous
3 min read
String in Data StructureA string is a sequence of characters. The following facts make string an interesting data structure.Small set of elements. Unlike normal array, strings typically have smaller set of items. For example, lowercase English alphabet has only 26 characters. ASCII has only 256 characters.Strings are immut
2 min read
Hashing in Data StructureHashing is a technique used in data structures that efficiently stores and retrieves data in a way that allows for quick access. Hashing involves mapping data to a specific index in a hash table (an array of items) using a hash function. It enables fast retrieval of information based on its key. The
2 min read
Linked List Data StructureA linked list is a fundamental data structure in computer science. It mainly allows efficient insertion and deletion operations compared to arrays. Like arrays, it is also used to implement other data structures like stack, queue and deque. Hereâs the comparison of Linked List vs Arrays Linked List:
2 min read
Stack Data StructureA Stack is a linear data structure that follows a particular order in which the operations are performed. The order may be LIFO(Last In First Out) or FILO(First In Last Out). LIFO implies that the element that is inserted last, comes out first and FILO implies that the element that is inserted first
2 min read
Queue Data StructureA Queue Data Structure is a fundamental concept in computer science used for storing and managing data in a specific order. It follows the principle of "First in, First out" (FIFO), where the first element added to the queue is the first one to be removed. It is used as a buffer in computer systems
2 min read
Tree Data StructureTree Data Structure is a non-linear data structure in which a collection of elements known as nodes are connected to each other via edges such that there exists exactly one path between any two nodes. Types of TreeBinary Tree : Every node has at most two childrenTernary Tree : Every node has at most
4 min read
Graph Data StructureGraph Data Structure is a collection of nodes connected by edges. It's used to represent relationships between different entities. If you are looking for topic-wise list of problems on different topics like DFS, BFS, Topological Sort, Shortest Path, etc., please refer to Graph Algorithms. Basics of
3 min read
Trie Data StructureThe Trie data structure is a tree-like structure used for storing a dynamic set of strings. It allows for efficient retrieval and storage of keys, making it highly effective in handling large datasets. Trie supports operations such as insertion, search, deletion of keys, and prefix searches. In this
15+ min read
Algorithms
Searching AlgorithmsSearching algorithms are essential tools in computer science used to locate specific items within a collection of data. In this tutorial, we are mainly going to focus upon searching in an array. When we search an item in an array, there are two most common algorithms used based on the type of input
2 min read
Sorting AlgorithmsA Sorting Algorithm is used to rearrange a given array or list of elements in an order. For example, a given array [10, 20, 5, 2] becomes [2, 5, 10, 20] after sorting in increasing order and becomes [20, 10, 5, 2] after sorting in decreasing order. There exist different sorting algorithms for differ
3 min read
Introduction to RecursionThe process in which a function calls itself directly or indirectly is called recursion and the corresponding function is called a recursive function. A recursive algorithm takes one step toward solution and then recursively call itself to further move. The algorithm stops once we reach the solution
14 min read
Greedy AlgorithmsGreedy algorithms are a class of algorithms that make locally optimal choices at each step with the hope of finding a global optimum solution. At every step of the algorithm, we make a choice that looks the best at the moment. To make the choice, we sometimes sort the array so that we can always get
3 min read
Graph AlgorithmsGraph is a non-linear data structure like tree data structure. The limitation of tree is, it can only represent hierarchical data. For situations where nodes or vertices are randomly connected with each other other, we use Graph. Example situations where we use graph data structure are, a social net
3 min read
Dynamic Programming or DPDynamic Programming is an algorithmic technique with the following properties.It is mainly an optimization over plain recursion. Wherever we see a recursive solution that has repeated calls for the same inputs, we can optimize it using Dynamic Programming. The idea is to simply store the results of
3 min read
Bitwise AlgorithmsBitwise algorithms in Data Structures and Algorithms (DSA) involve manipulating individual bits of binary representations of numbers to perform operations efficiently. These algorithms utilize bitwise operators like AND, OR, XOR, NOT, Left Shift, and Right Shift.BasicsIntroduction to Bitwise Algorit
4 min read
Advanced
Segment TreeSegment Tree is a data structure that allows efficient querying and updating of intervals or segments of an array. It is particularly useful for problems involving range queries, such as finding the sum, minimum, maximum, or any other operation over a specific range of elements in an array. The tree
3 min read
Pattern SearchingPattern searching algorithms are essential tools in computer science and data processing. These algorithms are designed to efficiently find a particular pattern within a larger set of data. Patten SearchingImportant Pattern Searching Algorithms:Naive String Matching : A Simple Algorithm that works i
2 min read
GeometryGeometry is a branch of mathematics that studies the properties, measurements, and relationships of points, lines, angles, surfaces, and solids. From basic lines and angles to complex structures, it helps us understand the world around us.Geometry for Students and BeginnersThis section covers key br
2 min read
Interview Preparation
Practice Problem