This repository contains the solution to creating multi dimensional dynamic arrays using std::vector and dynamic arrays. The idea is to define the size of the array at run time and not compile time.

Loading an array with random integers within a specified range. Sorting the array using a bubble sort algorithm. Searching for a user-specified element. Deleting the found element and dynamically ...

Pointer to an array is also known as array pointer. We are using the pointer to access the components of the array. int a[3] = {3, 4, 5 }; int *ptr = a; We have a pointer ptr that focuses to the 0th ...

The main reason to resize a dynamic array is to avoid wasting space or running out of space. If your dynamic array is too large for the amount of data it stores, you are wasting memory that could be ...

The previous two posts (part 1 and part 2) have been exploring the fundamentals of using pointers from the basics of declaring a pointer to the more complex notation of manipulating pointers. An ...

One of the fundamental issues in driver design is deciding how to map to the peripheral registers. Over the years there have been many different methods that have been used such as setting up ...

Pointer arrays are a useful tool for mapping peripheral registers to a driver. There are many advantages to using pointer arrays such as simplified initializations and the ability to generate a ...