Difference between Static Arrays and Dynamic Arrays Last Updated : 20 Dec, 2023 Comments Improve Suggest changes Like Article Like Report In the Data structure, we know that an array plays a vital role in having similar types of elements arranged in a contiguous manner with the same data type. According to the concept of array, an array can be defined in two ways as per the memory allocation concept. Types of Arrays:There are basically two types of arrays: Static Array: In this type of array, memory is allocated at compile time having a fixed size of it. We cannot alter or update the size of this array.Dynamic Array: In this type of array, memory is allocated at run time but not having a fixed size. Suppose, a user wants to declare any random size of an array, then we will not use a static array, instead of that a dynamic array is used in hand. It is used to specify the size of it during the run time of any program.Example: Let us take an example, int a[5] creates an array of size 5 which means that we can insert only 5 elements; we will not be able to add 6th element because the size of the array is fixed above. C++ int a[5] = {1, 2, 3, 4, 5}; //Static Integer Array int *a = new int[5]; //Dynamic Integer Array Java import java.util.*; class GFG { public static void main(String[] args) { // Static Array int[] staticArray = new int[5]; int[] numbers = { 1, 2, 3, 4, 5 }; // Dynamic Array // Create an ArrayList of integers. ArrayList<Integer> dynamicArray = new ArrayList<>(); // Add elements to the dynamic array. dynamicArray.add(1); dynamicArray.add(2); dynamicArray.add(3); // Remove an element from the dynamic array. dynamicArray.remove(1); } } Python # Static List a_static = [1, 2, 3, 4, 5] # Dynamic List (equivalent to dynamic array in some contexts) a_dynamic = [0] * 5 # Initialize with zeros, similar to new int[5] in C++ # Alternatively, you can use the list() constructor to create a dynamic list a_dynamic_alternative = list(range(5)) # Print the lists print("Static List:", a_static) print("Dynamic List:", a_dynamic) print("Dynamic List (alternative):", a_dynamic_alternative) # Coded By Block_Cipher C# using System; class Program { static void Main(string[] args) { // Static List int[] a_static = { 1, 2, 3, 4, 5 }; // Dynamic List (equivalent to dynamic array in some contexts) int[] a_dynamic = new int[5]; // Initialize with default values (0 for int), similar to new int[5] in C# // Alternatively, you can use a loop to initialize the dynamic list int[] a_dynamic_alternative = new int[5]; for (int i = 0; i < a_dynamic_alternative.Length; i++) { a_dynamic_alternative[i] = i; } // Print the lists Console.Write("Static List: "); PrintArray(a_static); Console.Write("Dynamic List: "); PrintArray(a_dynamic); Console.Write("Dynamic List (alternative): "); PrintArray(a_dynamic_alternative); } // Method to print an array static void PrintArray(int[] arr) { foreach (int item in arr) { Console.Write(item + " "); } Console.WriteLine(); } } JavaScript // Static Integer Array const staticArray = [1, 2, 3, 4, 5]; // Dynamic Integer Array (Array with size allocation) const dynamicArray = new Array(5); // Allocating memory for 5 elements // Initializing dynamic array elements for (let i = 0; i < dynamicArray.length; i++) { dynamicArray[i] = i + 1; // Assigning values 1, 2, 3, 4, 5 } // Printing Static Integer Array console.log("Static Integer Array:"); console.log(staticArray.join(" ")); // Printing Dynamic Integer Array console.log("Dynamic Integer Array:"); console.log(dynamicArray.join(" ")); The code mentioned above demonstrates the declaration and initialization of both a static integer array and a dynamic integer array. Let's break it down line by line: Example of Static Array: int a[5] = {1, 2, 3, 4, 5}; A static integer array named a and initializes with the values 1, 2, 3, 4, and 5.The size of this array is determined automatically based on the number of values provided in the initialization list.Thus the array a is allocated on the stack, and its size cannot be changed once defined.Example of Dynamic Array: int *a = new int[5]; In this code, we declare a pointer to an integer named a and it allocates memory in a dynamic fashion for an integer array of size 5.The new keyword here is used for dynamic memory allocation, and int[5] specifies the size of this dynamic array.The new operator is used to return the address of the dynamically allocated memory, which is already stored in the pointer a.This array a is allocated on the Heap, and its size can be modified later if needed.The differences between static and dynamic arrays based on this code snippet can be as followed:Static Integer Array: The size is determined automatically based on the number of values provided during initialization (in this case, 5).The memory is allocated on the stack.The size of the array is fixed once it is defined.Dynamic Integer Array: The memory is allocated during the run time by using the new keyword.The size is specified explicitly (in this case, 5).The memory is allocated on the heap (not the stack).We can change the size of the array later by using delete[ ] which is used to to deallocate the memory and allocating a new block with a different size if desired. Pictorial Representation of Static and Dynamic Arrays:Static Array and Dynamic ArrayKey Difference between Static and Dynamic Arrays:Static Array Dynamic Array 1. The memory allocation occurs during compile time. 1. The memory allocation occurs during run time. 2. The array size is fixed and cannot be changed. 2. The array size is not fixed and can be changed. 3. The location is in Stack Memory Space. 3. The location is in Heap Memory Space. 4. The array elements are set to 0 or to empty strings. 4. The array elements can be destroyed during erase statement and the memory is then released. 5. This array can be Initialized but not erased. 5. This array cannot be read or written after destroying. Comment More infoAdvertise with us P profkunalroy Follow Improve Article Tags : DSA Arrays Dynamic Memory Allocation Practice Tags : Arrays Similar Reads Basics & PrerequisitesLogic Building ProblemsLogic building is about creating clear, step-by-step methods to solve problems using simple rules and principles. Itâs the heart of coding, enabling programmers to think, reason, and arrive at smart solutions just like we do.Here are some tips for improving your programming logic: Understand the pro 2 min read Analysis of AlgorithmsAnalysis of Algorithms is a fundamental aspect of computer science that involves evaluating performance of algorithms and programs. Efficiency is measured in terms of time and space.BasicsWhy is Analysis Important?Order of GrowthAsymptotic Analysis Worst, Average and Best Cases Asymptotic NotationsB 1 min read Data StructuresArray 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 AlgorithmsSearching 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 AdvancedSegment 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 PreparationInterview Corner: All Resources To Crack Any Tech InterviewThis article serves as your one-stop guide to interview preparation, designed to help you succeed across different experience levels and company expectations. Here is what you should expect in a Tech Interview, please remember the following points:Tech Interview Preparation does not have any fixed s 3 min read GfG160 - 160 Days of Problem SolvingAre you preparing for technical interviews and would like to be well-structured to improve your problem-solving skills? Well, we have good news for you! GeeksforGeeks proudly presents GfG160, a 160-day coding challenge starting on 15th November 2024. In this event, we will provide daily coding probl 3 min read Practice ProblemGeeksforGeeks Practice - Leading Online Coding PlatformGeeksforGeeks Practice is an online coding platform designed to help developers and students practice coding online and sharpen their programming skills with the following features. GfG 160: This consists of most popular interview problems organized topic wise and difficulty with with well written e 6 min read Problem of The Day - Develop the Habit of CodingDo you find it difficult to develop a habit of Coding? If yes, then we have a most effective solution for you - all you geeks need to do is solve one programming problem each day without any break, and BOOM, the results will surprise you! Let us tell you how:Suppose you commit to improve yourself an 5 min read Like