Dynamic arrays are not inherent functions in C, unlike certain higher-level languages like Python and JavaScript, although C does offer various features or techniques to use dynamic arrays. These are the arrays that can be randomly accessed and resizable. Any size can be used as the starting value for a dynamic array in C or a dynamic array in C++, and the size can be modified further in the code. Variable length arrays in C operate on the stack, whereas dynamic arrays operate on the heap.

A dynamic array in C differs from a variable length array. The structure must include at least one more named member in addition to the flexible array member, to mention a few of its varieties.

Allocation: The dynamic array in C is slower than the variable-length array because the variable-length array is allocated on the stack rather than the heap.
Scope: Dynamic arrays in C or CPP are not constrained by scope, allowing them to be used anywhere in a programme until the memory is called using the free () method, in contrast to variable length arrays, which act like regular arrays and are constrained by scope.
Performance: Because memory for dynamic arrays in c or CPP must be manually created and deallocated, variable-length arrays are faster than dynamic arrays in c.

Different Techniques for Creating Dynamic Arrays in C

In C, there are several ways to build a dynamic array. Here, we'll discuss 5 ways to make a dynamic array in c.

The following are the five approaches we'll cover for creating dynamic arrays in C:

By using the malloc() Function.
By using calloc() Function.
By using Variable Length Array
By resizing array using realloc() function
By using flexible array members.

1) Dynamic Array in C using malloc() function:

In C, a single big block of memory with the required size is created dynamically using the "malloc" or "memory allocation" mechanism. It gives back a void pointer that can be converted into any other kind of pointer. It's a part of the header file. The following syntax demonstrates how to build a dynamic array in C using the malloc() function:

ptr = (cast-type*) malloc(byte-size);

Example of using C's malloc() method to create a dynamic array

In this part, we'll construct a dynamic array in C using the malloc function and talk about the relevant code and results.

#include <stdio.h>
#include <stdlib.h>
int main() {
 int* pointer;
 int m;
 // Get the size of the array
 printf("Enter size of array: ");
 scanf("%d", &m);
 // Allocate memory for the array
 pointer = (int*) malloc(m * sizeof(int));
 if (pointer == NULL) {
 printf("Memory allocation failed.\n");
 }
 else {
 printf("Memory successfully allocated using malloc.\n");
 // Initialize the elements of the array
 for (int i = 0; i < m; i++) {
 pointer[i] = i + 1;
 }
 // Print the elements of the array
 printf("Elements of the array: ");
 for (int i = 0; i < m; i++) {
 printf("%d ", pointer[i]);
 }
 printf("\n");
 }
 // Free the allocated memory
 free(pointer);
 return 0;
}

Output:

Explanation of the Code

In the code above, we first ask the user to specify the array's size before allocating its elements. We are outputting the values of the dynamic array's elements after setting their values in c.

2) Using the calloc() method, a dynamic array.

In C, the necessary number of memory blocks of the needed type are dynamically allocated using the "calloc" or "contiguous allocation" mechanism. This method of allocating memory blocks uses a mechanism that initialises each block with the value 0 by default.

Allocating memory for a dynamic array in c is similar to using the calloc() function and the malloc() method. Calloc() differs from malloc in that it takes more than one parameter (). The requirements for the dynamic array in C are shown below, along with information on the size of each element and the necessary number of elements.The members of the array are all initially set to 0.

ptr = (int*) calloc(5, sizeof(float));

Example of using the calloc function to create a dynamic array in C

In this part, we'll build a dynamic array in C using the calloc function and talk about the accompanying code and results.

#include <stdio.h>
#include <stdlib.h>
int main(){
 // address of the block created hold by this pointer
 int* pointer;
 int m;
// taking the size as input from the user
printf("Enter size of elements:");
 scanf("%d", &m);
// allocating the memory using calloc dynamically
pointer = (int*)calloc(m, sizeof(int));
 // Checking for memory allocation
 if (pointer == NULL) {
 printf("Memory not allocated .\n");
 }
 else {
 // Memory allocated
 printf("Memory successfully allocated using "
 "calloc.\n");
 // Get the elements of the array
 for (int j = 0; j < m; ++j) {
 pointer[j] = j + 10;
 }
 // Print the elements of the array
 printf("The elements of the array are: ");
 for (int k = 0; k < m; ++k) {
 printf("%d, ", pointer[k]);
 }
 }
 return 0;
}

Output:

Explanation of the code in question

In the code above, we first ask the user to specify the array's size before allocating its elements. We are outputting the values of the dynamic array's elements after setting their values in c.

3) Using the realloc() function, dynamically resize a dynamic array in C.

To dynamically change the memory allocation of previously allocated memory in C, use the "realloc" or "re-allocation" approach. In other words, if the memory initially allocated via malloc or calloc is insufficient, realloc can be used to dynamically re-allocate memory. The existing value is preserved after reassigning memory, and brand-new blocks are first filled with garbage.

ptr = realloc(ptr, newSize);

An example of using the realloc() method to resize a dynamic array in C

This example will demonstrate how to allocate new values to the elements after increasing the size of a dynamic array in C after all the elements have been allocated.

#include <stdio.h>
#include <stdlib.h>
int main()
{
 // address of the block created hold by this pointer
 int* ptr;
 int size = 5;
 ptr = (int*)calloc(size, sizeof(int));
 if (ptr == NULL) {
 printf("Memory not allocated.\n");
 exit(0);
 }
 else {
 printf("Memory successfully allocated using "
 "calloc.\n");
 }
 // inserting elements
 for (int j = 0; j < size; ++j) {
 ptr[j] = j + 10;
 }
 printf("The elements of the array are: ");
 for (int k = 0; k < size; ++k) {
 printf("%d, ", ptr[k]);
 }
 printf("\n");
 size = 15;
 int *temp = ptr;
 // using realloc
 ptr = realloc(ptr, size * sizeof(int));
 if (!ptr) {
 printf("Memory Re-allocation failed.");
 ptr = temp;
 }
 else {
 printf("Memory successfully re-allocated using "
 "realloc.\n");
 }
 // inserting new elements
 for (int j = 5; j < size; ++j) {
 ptr[j] = j + 100;
 }
 printf("The new elements of the array are: ");
 for (int k = 0; k < size; ++k) {
 printf("%d, ", ptr[k]);
 }
 return 0;
}

Output

4) Variable Length Arrays

Variable length arrays, often known as VLAs, enable runtime changes to the array size. The local scope level serves as the foundation for the stack's memory allocation.

The disadvantage of a variable length array is that, unlike the methods previously stated, once defined, its size cannot be modified.

5) Flexible Array Members

An array that is defined inside a structure with no predefined dimensions and a changeable size is referred to as a flexible array member. The C99 standard was the first to provide this functionality.

The size of a flexible member may be controlled with the aid of the malloc() technique.
Ideally, the structure's array should be stated as its last member and have a size that may be changed (at runtime).
The flexible array member and at least one other named member must both be present in the structure.

Uses of Dynamic array in C

Dynamic arrays in C can be used in a variety of situations where you need to allocate and manage memory at runtime based on changing requirements.

Here are some common use cases:

Arrays of varying sizes: Dynamic arrays allow you to create arrays of varying sizes based on runtime conditions or user input. For example, when reading data from a file or a network, you may not know the exact size of the data in advance, and dynamic arrays can be used to allocate memory as needed to store the data.
Dynamic data structures: Dynamic arrays can serve as the underlying data structure for many other dynamic data structures, such as linked lists, stacks, queues, and trees. These data structures may need to grow or shrink dynamically as data is added or removed, and dynamic arrays can be used to efficiently manage the memory for these data structures.
Efficient memory management: Dynamic arrays can be used to optimize memory usage in situations where memory is limited. For example, when working with large datasets or in embedded systems with limited memory, dynamic arrays can be used to allocate only the memory that is actually needed, avoiding wasted memory and improving overall memory efficiency.
Runtime flexibility: Dynamic arrays can be used in situations where the size or shape of the data needs to change during program execution. For example, in numerical computing or image processing applications, dynamic arrays can be used to dynamically allocate memory for matrices or images that may need to be resized or reshaped based on runtime conditions or user interactions.
Efficient function parameter passing: Dynamic arrays can be used to pass large arrays efficiently to functions. Instead of copying the entire array, a pointer to the dynamically allocated array can be passed, reducing the overhead of copying large amounts of data and improving performance.
Dynamic string manipulation: Dynamic arrays can be used for string manipulation tasks, where the size of the string may change dynamically. For example, when reading input from the user or from a file, dynamic arrays can be used to allocate memory for strings of varying lengths, and can be resized as needed to accommodate the changing size of the string.
Implementing data buffers: Dynamic arrays can be used to implement data buffers for tasks such as input/output (I/O) operations or data streaming, where data needs to be temporarily stored and processed before being released or transferred.

Dynamic arrays provide flexibility, efficiency, and runtime adaptability in managing memory resources in C programs, making them a useful tool in various programming scenarios where the size or shape of data may change during runtime or when dealing with limited memory environments. However, it's important to be mindful of proper memory management practices to avoid memory leaks and other issues.

Advantages of Dynamic array in C

Dynamic size: Dynamic arrays allow you to allocate and resize memory at runtime, which means you can create arrays of varying sizes depending on the needs of your program. This flexibility is particularly useful when you don't know the size of the array in advance or when you need to create arrays that grow or shrink dynamically during program execution.
Memory efficiency: Dynamic arrays allow you to allocate only the memory that you actually need, unlike static arrays which require a fixed amount of memory to be allocated at compile-time, regardless of whether you use it all or not. This can help you optimize memory usage in your program, especially when dealing with large arrays or limited memory environments.
Avoidance of stack overflow: In C, static arrays are typically allocated on the stack, which has a limited size. If you try to create a very large static array, it may cause a stack overflow, leading to program termination. Dynamic arrays, on the other hand, are allocated on the heap, which has a much larger memory space, allowing you to create arrays that are much larger than what the stack can handle.
Runtime flexibility: Dynamic arrays allow you to dynamically allocate, resize, and deallocate memory during program execution, providing you with greater flexibility in managing memory resources. This allows you to adapt your program's memory requirements based on runtime conditions or user input, making your program more dynamic and adaptable.
Ease of passing arrays to functions: Dynamic arrays can be easily passed to functions as pointers, allowing you to efficiently share large arrays across different parts of your program without having to create multiple copies of the same data. This can help you optimize memory usage and improve performance.
Dynamic data structures: Dynamic arrays are the foundation for many dynamic data structures such as linked lists, stacks, queues, and trees, which are widely used in data processing and manipulation. Dynamic arrays provide the underlying mechanism for these data structures to grow or shrink dynamically as data is added or removed, making them more efficient and adaptable.

Overall, dynamic arrays in C provide increased flexibility, memory efficiency, and runtime adaptability compared to static arrays, making them a powerful tool for managing and manipulating data in C programs. However, it's important to be mindful of proper memory management techniques, such as allocating and freeing memory correctly using malloc, calloc, realloc, and free, to avoid memory leaks and other issues

Disadvantages of Dynamic array in C

Manual memory management: Dynamic arrays require manual memory management, which means you need to explicitly allocate memory using malloc, calloc, or realloc, and free the memory using free. Failure to properly manage memory can result in memory leaks, where allocated memory is not freed, or accessing memory that has been freed, leading to undefined behavior and program crashes.
Memory fragmentation: Dynamic arrays can lead to memory fragmentation, where memory is allocated and deallocated in a non-contiguous manner, resulting in fragmented free memory blocks. Over time, this can cause inefficient memory usage, as it may become challenging to find contiguous blocks of free memory for large allocations, leading to increased memory overhead and reduced performance.
Overhead of dynamic memory allocation: Dynamic memory allocation involves overhead in terms of time and space. Allocating memory dynamically requires additional time compared to stack-based allocation, as it involves system calls and managing memory structures. Additionally, dynamic memory allocation may consume more memory compared to static arrays due to memory alignment requirements and internal bookkeeping data structures used by the memory allocator.
Potential for memory-related bugs: Dynamic arrays can introduce memory-related bugs such as buffer overflows, dangling pointers, and use-after-free errors if not managed properly. These bugs can be difficult to detect and fix, and can lead to crashes or security vulnerabilities in your program.
Complexity and error-prone nature: Dynamic arrays can introduce complexity in your code due to the need for manual memory management and proper error handling. Incorrect usage of dynamic arrays, such as accessing memory out of bounds or failing to check for memory allocation failures, can lead to bugs and unexpected behavior in your program.
Lack of compile-time size checking: Unlike static arrays, which have their size determined at compile-time, dynamic arrays do not have compile-time size checking. This means that you need to be careful when accessing elements in a dynamic array to avoid out-of-bounds errors, as there are no compile-time checks to prevent such mistakes.
Portability concerns: Dynamic memory allocation functions such as malloc, calloc, and realloc are not part of the C standard library and may have implementation-dependent behavior. This can result in portability concerns when writing code that needs to work across different platforms or compilers.

Despite these disadvantages, dynamic arrays are widely used in C programming due to their flexibility and versatility in managing memory at runtime. However, it's important to be aware of the potential pitfalls and follow proper memory management practices to avoid memory-related bugs and ensure reliable and efficient code.

History

Dynamic arrays have been a fundamental feature of computer programming languages for many years. The concept of dynamic memory allocation, which allows for the allocation and deallocation of memory during runtime, has evolved over time as programming languages have developed.

The origins of dynamic arrays can be traced back to the early days of programming languages like FORTRAN and C, where static arrays with fixed sizes were commonly used. However, static arrays have limitations in that their sizes are determined at compile-time, and they cannot be easily resized during runtime. This limitation led to the development of dynamic arrays, which allow for more flexible memory management.

Conclusion

Dynamic arrays in C can be implemented using pointers and memory allocation functions such as malloc and realloc. Dynamic arrays allow for more flexibility in terms of size compared to static arrays, but they require more careful management of memory allocation and deallocation. Proper memory management is essential to avoid memory leaks and segmentation faults.

C Tutorial