C Tutorial

C Tutorial C Language Environment Setup Execution flow of C program C printf and Scanf C Data type C Token Variable in C Operators in C Comments in C Escape Sequence in C C – Storage Classes C Decision control statement Loop Statement in C Break, continue and goto statement in C Type Casting in C Function in C Recursion in C String in C C Array Pointer in C Dynamic memory allocation C –Structure Nested Structure in C Union in C File Handling in C C pre-processor Static Function In C Sizeof In C Selection Sort In C Scope Of Variables In C Runtime Vs Compile Time In C Random Access Lseek In C Queue Implementation In C Pseudo Code In C Prototype In C Pointer To Pointer In C Pointer Arithmetic In C Passing Array To Function In C Null Character In C Merge Sort In C Macros In C Library Functions In C Memory Leak In C Int In C Goto And Labels In C Fibonacci Series In C Fflush In C Derived Data Types In C Data Types In C Const Vs Volatile In C Character Set In C Character Class Tests In C Calloc In C C Pointers Arrays In C Include In C Clrscr In C C Vs Java String Literals In C Types Of Pointers In C Variables In C Volatile In C Why C Is A Middle Level Language Infix To Postfix Program In C Ceil function in C LCM of two numbers in C Quick sort in C Static in C function pointer as argument in C Top Array Keywords in C Add two numbers using the function in C Armstrong program in C using function Array, Declaring Arrays and Array Initialization Limitations of Inline Function in C Merge and Merge sort with example in C Do-While Loop in C For Loop in C While-Loop in C Difference between while and do-while loop in C Array Of Structures in C Data Structures And Algorithms in C Types Of Structures In C How to Avoid Structure Padding in C Use of Structure in C Do WHILE LOOP in C Programming Examples For Loop in C Programming Examples Entry Control Loop in C Exit control loop in C Infinite loop in C Nested loop in C pow() function in C String Handling functions in C Prime Number code in C Factorial Program in C using For Loop Factorial Program in C Using While Loop Fibonacci Series in C Using For Loop Fibonacci series in C using while loop Prime Number Program in C using for Loop While Loop in C programming examples Built-in functions in C Assert() Function C vs Java Strings Call Back Function in Embedded C Else If Ladder fgets() function Ftell() Function getc() function getch() function gets() function Heap Sort Nested if-else statement Pi() Function Positioning of file Write() function abs() function in C Attributes in C C program to find factorial of a number using Recursion Ferror() in c fopen() function in C Fibonacci series program in C using Recursion Formatted Input and output function in C Snake Game in C User Defined Functions in C Beep() function in C Cbrt() function in C Hook() function in C Isalnum() function in C C Program to find the Roots of a Quadratic Equation C Switch Statements Difference between rand() and srand() function in C Difference between while and for loop in C Doubly Linked list in C Example of Iteration in C How to use atoi() function in C How to use floor() function in C How to use sine() function in C How to use Typedef Struct in C Integer Promotions in C C Program Swap Numbers in cyclic order Using Call by Reference C Program to Find Largest Number Using Dynamic Memory Allocation C Program to Find the Largest Number using Ternary Operator C/C++ Program to Find the Size of int, float, double and char Find the Largest Three Distinct Elements in an Array using C/C++ Loop Questions in C Modulus on Negative Numbers in C Multiplication table program in C using For loop Nested Loops in C Programming Examples C Program for Mean and Median of an Unsorted Array Results of Comparison Operations in C and C++ Reverse a Stack using Recursion in C Simple hash() function in C strcat() Function in C Sum of N numbers in C using For loop Use of free() function in C Write a program that produces different results in C and C++ C Function Argument and Return Values Keywords in C Bank management system in C Calendar application in C Floor() Function in C Free() Function in C How to delete a file in C How to move a text in C Remove an element from an array in C Unformatted input() and output() function in C What are linker and loader in C SJF Scheduling Program in C Socket Programming in C Structure in C Tower of Hanoi in C Union Program in C Variable Declaration in C What is Linked List in C While Loop Syntax in C fork() in C GCD program in C Branching Statements in C Comma Operator in C Control statement in C Double Specifier in C How to create a binary file in C Long int in C Palindrome Number in C Pure Virtual Function in C Run Time Polymorphism in C Types of Array in C Types of Function in C What is a buffer in C What is required in each C Program Associativity of Operators in C Bit Stuffing Program in C Actual and Formal Parameters Addition of two Numbers in C Advantages of function in C Arithmetic Progression Program in C Binomial Coefficient Program in C Difference between Array and List in C Diffie-Hellman Algorithm in C How to convert a number to words in C How to convert a string to hexadecimal in C Difference between If and Switch Statement in C C and C++ Binary Files C program that does not Suspend when Ctrl+Z is Pressed Different ways to Declare the Variable as Constant in C Range of Int in C C Program to find the size of a File FIFO Example in the C Language For loop in C Programming GCD program of two numbers in C GPA Calculator in C How to Calculate Time Complexity in C How to include graphics.h in C How to measure time taken by a function in C How to return a Pointer from a Function in C What is the main in C Addition of Matrix in C Booleans in C C Program for Extended Euclidean algorithms C Program of Fencing the Ground Ceil and Floor in C Compound Interest Program in C Displaying Array in C Distance Vector Routing Protocol Program in c Dos.h Header File in C Language DSA Program in C Explain the two-way selection in C Fee Management System in C File Operations in C Malloc function in C Multiplication Table in C Simple Programs in C Language tolower() Function in C Type Conversion in the C Why does sizeof(x++) not Increment x in C Advantages of Dynamic Memory Allocation in C Armstrong Number in C Assignment Operator Program in C Banker’s Algorithm in C Binary Search in C with Best and Worst Time Complexity Caesar Cipher Program in C Call by Value and Call by Reference in C Conditional Operator in C CRC Program in C Deadlock Detection Program in C Decimal to Binary in C Difference between If Else and Nested If Else in C Difference between Pre-increment and Post-increment in C Difference between Scope and Lifetime in C Evaluation of Arithmetic Expression in C Explain the Increment and Decrement Operators in C Fseek Function in C Functions in C How to Find Square Free Numbers in C Length of an Array Function in C OpenGL in C Projects on C language in 2023 Purpose of a Function Prototype in C Stdio.h in C Two-Dimensional array in C What is String Comparison in C C Compilers for Windows Functions and Recursion in C How to Declare Boolean in C How to Declare Character in C How to Round up a number in C How to use strlen() in C Pointer Declaration in C Algorithm for String Palindrome in C C Program to find ASCII value of a character Constant Pointer in C How to find string length in C using strlen() function Implicit and Explicit in C Indirect Recursion in C Input and Output functions in C isupper() in C Jump Statement in C Lifetime of a Variable in C Linker Error in C Language Numeric Constant in C Size of Pointer in C Square Root in C Language Static and Dynamic Memory allocation String Declaration in C Strong Number in C Symmetric Matrix in C Types of C Tokens What is a Size of Pointer in C What is Increment and Decrement Operator in C 1 2 3 4 Series Program in C Advantages and Disadvantages of C Language C Program for Polynomial Addition C Program to Count the Number of Vowels in a String C Programming Errors and Solutions Compilation Errors in C Complex C Programs Difference between Argument and Parameter in C Difference between char s[] and char *s in C Evaluation of Postfix Expression Using Stack in C Find Leftmost and Rightmost Set Bit of a Number fprintf and fscanf in C Introduction to Dynamic Array in C Print Address in C Realloc function in C Ternary Operators in C Types of Tokens in C with Examples Difference between Static and Dynamic Memory Allocation in C Addition Program in C Array Definition in C Array of Pointers in C Arrow Operator in C Average of Two Numbers in C Binary to Decimal in C Binary to Octal in C BREAK STATEMENT in C C Programming Operators Questions C Programs Asked in Interview Calculator Program in C C Program to Read and Print an Employee's Detail Using Structure Bubble Sort Algorithm in C C Program to Find Area and Perimeter of Circle C Program to Check Whether a Given Number is Even or Odd C in Roman Numerals C Program to Make a Simple Calculator Using Switch Case Insertion Sort Program in C How to take input in string in C GCC Conflicting Types in C Function Definition in C Format Specifier for Hexadecimal in C Flowchart in C Float in C Fizzbuzz Implementation in C Conditional Statement in C Conio.h functions list in C Constants in C Dynamic Array in C Decision Making Statements in C Continue Statement in C Creation of Thread in C DFS Algorithm in C Difference between parameter and arguments in C Dijkstra's Algorithm in C Leap Year Program in C Jump Statements in C Modulus Operator in C Memory Allocation in C Simple Interest Program in C Reverse Array in C Recursive Function in C Queue in C Printing Pascal’s Triangle in C Preprocessor Directives in C Perror() in C Perfect Number in C Programming Language Parameter Passing Techniques in C Pascal Triangle in C Patterm Program in C Affine cipher in C Dereferencing pointer in C Internal static variable vs External static variables in C Difference between exit(0) and exit(1) in C Booth's Algorithm in C Condition Control Statements in C Double Specifier in C Dynamic variables in C How to print alphabets in C How to print char array in c Order of Evaluation in C Order of Operations in C Semantic Error in C Size of String Variable in C SJF PREEMPTIVE SCHEDULING PROGRAM C: Tree in C Arithmetic Progression Program in C Array, Declaring Arrays, and Array Initialization ARRAYS IN C Assert() Function in c Atoi in C Banker’s Algorithm in C Bar3d() function in C Graphics Beep function in c Bigint (BIG INTEGERS) in C with Example Builtin functions of GCC compiler Fibonacci series in C Priority Queue in C 2D ARRAY IN C 7 Best IDEs for C/C++ Developers in 2022 Addition of Two Numbers in C Advantages and Disadvantages of C Language Advantages of Function in C Algorithm for String Palindrome in C

Dynamic Array in C

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:

  1. By using the malloc() Function.
  2. By using calloc() Function.
  3. By using Variable Length Array
  4. By resizing array using realloc() function
  5. 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:

Dynamic Array in C

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:

Dynamic Array in C

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

Dynamic Array in C

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:

  1. 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.
  2. 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.
  3. 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.
  4. 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.
  5. 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.
  6. 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.
  7. 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

  1. 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.
  2. 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.
  3. 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.
  4. 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.
  5. 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.
  6. 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

  1. 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.
  2. 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.
  3. 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.
  4. 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.
  5. 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.
  6. 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.
  7. 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.