Memory management is a key concept in C programming. Often, programmers do not know the exact amount of memory needed before a program starts running. This is where dynamic memory allocation is helpful.<\/p>\n\n\n\n
Dynamic memory allocation in C allows programs to request memory while running, rather than reserving it all at compile time. This approach offers flexibility, improves memory use, and supports scalable applications.<\/p>\n\n\n\n
In this article, we will examine the four dynamic memory allocation functions in C and understand their roles in managing memory effectively.<\/p>\n\n\n\n
Dynamic memory allocation allocates memory during runtime instead of at compile time. It lets programs request memory only when it’s needed, helping manage memory efficiently during execution. This provides flexibility and allows programs to respond to changing data needs.<\/p>\n\n\n\n
A C program<\/a> primarily utilizes two main memory areas: stack memory and heap memory.<\/p>\n\n\n\n Stack memory holds local variables and function calls, while heap memory is used for dynamic memory allocation.<\/p>\n\n\n\n When memory is allocated using functions like malloc() or calloc(), that memory is created in the heap<\/a>.<\/p>\n\n\n\n To use dynamic memory allocation functions, you need to include the following header file:<\/p>\n\n\n\n #include <stdlib.h><\/p>\n\n\n\n The malloc() function stands for memory allocation. It allocates a block of memory at runtime.<\/p>\n\n\n\n The allocated memory initially contains garbage values because it is not automatically initialized.<\/p>\n\n\n\n ptr = (datatype*) malloc(size_in_bytes);<\/p>\n\n\n\n #include <stdio.h><\/p>\n\n\n\n #include <stdlib.h><\/p>\n\n\n\n int main() {<\/p>\n\n\n\n int *ptr;<\/p>\n\n\n\n int n = 5;<\/p>\n\n\n\n ptr = (int*) malloc(n * sizeof(int));<\/p>\n\n\n\n if(ptr == NULL) {<\/p>\n\n\n\n printf(“Memory allocation failed”);<\/p>\n\n\n\n return 1;<\/p>\n\n\n\n }<\/p>\n\n\n\n for(int i = 0; i < n; i++) {<\/p>\n\n\n\n ptr[i] = i + 1;<\/p>\n\n\n\n }<\/p>\n\n\n\n printf(“Array elements:\\n”);<\/p>\n\n\n\n for(int i = 0; i < n; i++) {<\/p>\n\n\n\n printf(“%d “, ptr[i]);<\/p>\n\n\n\n }<\/p>\n\n\n\n free(ptr);<\/p>\n\n\n\n return 0;<\/p>\n\n\n\n }<\/p>\n\n\n\n Array elements:<\/p>\n\n\n\n 1 2 3 4 5<\/p>\n\n\n\n The malloc() function is useful when the memory size is unknown before execution. It returns NULL if memory allocation fails.<\/p>\n\n\n\n The calloc() function allocates memory for multiple elements and initializes all allocated bytes to zero.<\/p>\n\n\n\n Unlike malloc(), the memory returned by calloc() does not contain garbage values initially.<\/p>\n\n\n\n ptr = (datatype*) calloc(number_of_elements, size_of_each_element);<\/p>\n\n\n\n #include <stdio.h><\/p>\n\n\n\n #include <stdlib.h><\/p>\n\n\n\n int main() {<\/p>\n\n\n\n int *ptr;<\/p>\n\n\n\n int n = 5;<\/p>\n\n\n\n ptr = (int*) calloc(n, sizeof(int));<\/p>\n\n\n\n if(ptr == NULL) {<\/p>\n\n\n\n printf(“Memory allocation failed”);<\/p>\n\n\n\n return 1;<\/p>\n\n\n\n }<\/p>\n\n\n\n printf(“Values after calloc:\\n”);<\/p>\n\n\n\n for(int i = 0; i < n; i++) {<\/p>\n\n\n\n printf(“%d “, ptr[i]);<\/p>\n\n\n\n }<\/p>\n\n\n\n free(ptr);<\/p>\n\n\n\n return 0;<\/p>\n\n\n\n }<\/p>\n\n\n\n Values after calloc:<\/p>\n\n\n\n 0 0 0 0 0<\/p>\n\n\n\n The main advantage of calloc() is automatic initialization, which helps avoid unpredictable behavior caused by garbage values.<\/p>\n\n\n\n The realloc() function is used to resize previously allocated memory.<\/p>\n\n\n\n It can increase or decrease the size of an existing memory block while the program is running.<\/p>\n\n\n\n ptr = realloc(ptr, new_size);<\/p>\n\n\n\n #include <stdio.h><\/p>\n\n\n\n #include <stdlib.h><\/p>\n\n\n\n int main() {<\/p>\n\n\n\n int *ptr;<\/p>\n\n\n\n int n = 3;<\/p>\n\n\n\n ptr = (int*) malloc(n * sizeof(int));<\/p>\n\n\n\n for(int i = 0; i < n; i++) {<\/p>\n\n\n\n ptr[i] = i + 1;<\/p>\n\n\n\n }<\/p>\n\n\n\n n = 5;<\/p>\n\n\n\n ptr = (int*) realloc(ptr, n * sizeof(int));<\/p>\n\n\n\n for(int i = 3; i < n; i++) {<\/p>\n\n\n\n ptr[i] = i + 1;<\/p>\n\n\n\n }<\/p>\n\n\n\n printf(“Updated array:\\n”);<\/p>\n\n\n\n for(int i = 0; i < n; i++) {<\/p>\n\n\n\n printf(“%d “, ptr[i]);<\/p>\n\n\n\n }<\/p>\n\n\n\n free(ptr);<\/p>\n\n\n\n return 0;<\/p>\n\n\n\n }<\/p>\n\n\n\n Updated array:<\/p>\n\n\n\n 1 2 3 4 5<\/p>\n\n\n\n The realloc() function keeps existing data while changing the memory size. However, if resizing fails, it may return NULL.<\/p>\n\n\n\n The free() function releases dynamically allocated memory back to the system.<\/p>\n\n\n\n free(ptr);<\/p>\n\n\n\n int ptr = (int) malloc(5 * sizeof(int));<\/p>\n\n\n\n free(ptr);<\/p>\n\n\n\n If allocated memory is not released properly, memory leaks can occur. Memory leaks can gradually reduce available system memory and affect program performance.<\/p>\n\n\n\n Dynamic memory allocation is widely used in modern software systems where data size changes during execution.<\/p>\n\n\n\n Linked lists<\/a> use dynamic memory to create nodes as needed. Dynamic arrays can increase memory size based on user input. Operating systems also allocate memory dynamically for running processes and applications.<\/p>\n\n\n\n Database systems, gaming engines, file management systems, compilers, and networking applications all rely on runtime memory allocation.<\/p>\n\n\n\n One common mistake is forgetting to free allocated memory.<\/p>\n\n\n\n Example:<\/p>\n\n\n\n int *ptr = malloc(10 * sizeof(int));<\/p>\n\n\n\n If free(ptr) is not called later, the memory remains occupied even after it is no longer needed.<\/p>\n\n\n\n Another mistake is accessing memory after freeing it.<\/p>\n\n\n\n free(ptr);<\/p>\n\n\n\n printf(“%d”, ptr[0]);<\/p>\n\n\n\n This causes undefined behavior because the memory has already been released.<\/p>\n\n\n\n Programmers should also check whether allocation functions return NULL before using allocated memory.<\/p>\n\n\n\n You can also explore HCL GUVI\u2019s<\/strong> DSA ebook<\/strong><\/a> to understand how concepts like dynamic memory allocation are used in linked lists, trees, stacks, and queues.\u00a0<\/p>\n\n\n\n Always use sizeof() when allocating memory because it improves portability and accuracy.<\/p>\n\n\n\n Correct approach:<\/p>\n\n\n\n malloc(n * sizeof(int));<\/p>\n\n\n\n Always check if allocation succeeded before accessing memory.<\/p>\n\n\n\n if(ptr == NULL);<\/p>\n\n\n\n Memory should always be released after use.<\/p>\n\n\n\n free(ptr);<\/p>\n\n\n\n After freeing memory, setting the pointer to NULL helps prevent accidental access to invalid memory.<\/p>\n\n\n\n ptr = NULL;<\/p>\n\n\n\n Static memory allocation happens during compile time and typically uses stack memory.<\/p>\n\n\n\n Dynamic memory allocation<\/a> occurs during runtime and uses heap memory.<\/p>\n\n\n\n Static allocation is faster but less flexible, while dynamic allocation offers flexibility but requires manual memory management. Dynamic allocation is crucial when the amount of data changes at runtime.<\/p>\n\n\n\n Dynamic memory allocation enhances memory efficiency because it allocates memory only when necessary.<\/p>\n\n\n\n It provides runtime flexibility, supports scalable applications, and enables complex data structures like linked lists, trees, queues<\/a>, and graphs.<\/p>\n\n\n\n Programs can be more adaptable since the memory size can grow or shrink dynamically.<\/p>\n\n\n\n Dynamic memory allocation is slower than static allocation since memory management occurs during runtime.<\/p>\n\n\n\n Improper handling may lead to memory leaks, dangling pointers, fragmentation, and runtime errors.<\/p>\n\n\n\n Since memory management is manual in C, programmers must carefully handle allocation and deallocation.<\/p>\n\n\n\nHeader File Required<\/strong><\/h2>\n\n\n\n
1. malloc() Function in C<\/strong><\/h2>\n\n\n\n
Syntax<\/strong><\/h3>\n\n\n\n
Example Program<\/strong><\/h3>\n\n\n\n
Output<\/strong><\/h3>\n\n\n\n
2. calloc() Function in C<\/strong><\/h2>\n\n\n\n
Syntax<\/strong><\/h3>\n\n\n\n
Example Program<\/strong><\/h3>\n\n\n\n
Output<\/strong><\/h3>\n\n\n\n
3. realloc() Function in C<\/strong><\/h2>\n\n\n\n
Syntax<\/strong><\/h3>\n\n\n\n
Example Program<\/strong><\/h3>\n\n\n\n
Output<\/strong><\/h3>\n\n\n\n
4. free() Function in C<\/strong><\/h2>\n\n\n\n
Syntax<\/strong><\/h3>\n\n\n\n
Example<\/strong><\/h3>\n\n\n\n
Real World Applications of Dynamic Memory Allocation<\/strong><\/h2>\n\n\n\n
Common Mistakes in Dynamic Memory Allocation<\/strong><\/h2>\n\n\n\n
Best Practices for Dynamic Memory Allocation<\/strong><\/h2>\n\n\n\n
Static vs Dynamic Memory Allocation<\/strong><\/h2>\n\n\n\n
Advantages of Dynamic Memory Allocation<\/strong><\/h2>\n\n\n\n
Disadvantages of Dynamic Memory Allocation<\/strong><\/h2>\n\n\n\n