Introduction

We now know how to allocate dynamic arrays on the heap. We also know that we can size them, at runtime, according to the amount of data that needs to be stored. We no longer have to worry about running out of space!

However, what happens if at some point, after the allocation, we decide that we need more space?

The most obvious solution is to do the following steps:

Allocate a new array of the required size.
Copy the contents from the old array to the new array.
Deallocate the old array.

Implementing everything from scratch

Let’s see how to implement these steps in the code. Assume we want to store all numbers from 0 to n inside an array.

In line 9, we allocate one array arr, which can hold five elements (INITIAL_SIZE). We then initialize all elements in ascending order, such that arr[i] = i (lines 16–19). We print this array ...

Introduction

Stack and Local Memory

Passing Arguments to Functions

Pointer Arithmetic Basics

Pointers and Arrays

Pointers and Strings

Pointers and Functions

Write a Shell in C

Complex Pointer Declarations

Assessment 1

Heap and Dynamic Memory

Structures

Practicing Everything with Linked Lists

Assessment 2

Genericity Using Void Pointers

Advanced Memory Manipulation

Project Prep: Binary Search Trees

Efficiently Processing Temperature Samples

Efficient Dictionary

Efficiently Processing Employee Records

Conclusion

Reallocating Dynamic Arrays

Introduction

Implementing everything from scratch