Memory and Pointers

Articles covering pointers, references, dynamic memory management, and addressing in C++.

Memory and Pointers

The low-level power of C++: addressing, pointers and references; stack vs. heap; and dynamic memory management. Explore the risks of new/delete, safe patterns, and techniques to prevent memory leaks.

Goal: Apply addressing and dynamic memory correctly to write safe, bug-free C++ code.

TL;DR

Pointers & references: int* p, int& r, nullptr.
Dynamic memory: new/delete, new[]/delete[].
Arrays & pointer arithmetic: *(p + i).
Habits/tools: RAII; stepping stone to std::unique_ptr.

Addresses and Memory Basics in C++

25 June 2026 • Memory and Pointers

Learn the basics of addresses and memory in C++, including memory layout, variable addresses, and how data is stored.

C++ Memory

Read →

References vs Pointers in C++

25 June 2026 • Memory and Pointers

Learn the differences between references and pointers in C++, including use cases, advantages, and memory management.

C++ Pointer

Read →

Passing Parameters to Functions via Pointers in C++

25 June 2026 • Memory and Pointers

Learn how to pass parameters to functions via pointers in C++, including address passing, memory access, and practical examples.

C++ Functions Pointer

Read →

Relationship Between Arrays and Pointers in C++

25 June 2026 • Memory and Pointers

Learn the relationship between arrays and pointers in C++, including memory layout, pointer arithmetic, and array access.

Arrays C++ Pointer

Read →

Dynamic Memory Management in C++: new and delete

25 June 2026 • Memory and Pointers

Learn dynamic memory management in C++ using new and delete to allocate, release, and manage memory safely.

C++ C++ Memory Management new Operator

Read →

Memory Leaks and Analysis with Valgrind in C++

25 June 2026 • Memory and Pointers

Learn how to detect memory leaks in C++ and analyze applications with Valgrind to improve stability and memory usage.

C++ Memory Leaks

Read →

Multidimensional Arrays and Pointer Usage in C++

25 June 2026 • Memory and Pointers

Learn multidimensional arrays and pointer usage in C++, including memory layout, indexing, and pointer arithmetic with examples.

Arrays C++ Pointer

Read →

Introduction to Smart Pointers in C++

25 June 2026 • Memory and Pointers

Learn smart pointers in C++, including unique_ptr, shared_ptr, and weak_ptr for safe memory management and modern C++ development.

C++ Smart Pointers

Read →

In C++, choosing meaningful variable names makes the code easier to read and understand without needing extra comments.


// unclear
int x;
int y;

// clearer
int totalCount;
int maxRetries;

In C++, always check the result of std::find. If the element is not found, the iterator will be equal to container.end().


std::vector<int> numbers = {1, 2, 3};

auto it = std::find(numbers.begin(), numbers.end(), 5);

if (it != numbers.end())
{
    std::cout << "Found: " << *it << std::endl;
}
else
{
    std::cout << "Not found" << std::endl;
}

In C++, always add simple error checks before using values. Early checks prevent crashes and make bugs easier to find.


// risky: no check
int result = divide(a, b);

// safer: basic check
if (b == 0)
{
    return;
}

int result = divide(a, b);

In C++, keeping conditions simple by giving each comparison a single responsibility makes code easier to read and understand.


// hard to read
if (isActive && hasPermission && retryCount < 3)
{
    process();
}

// clearer
bool canProcess = isActive && hasPermission;

if (canProcess && retryCount < 3)
{
    process();
}

In C++, using a range-based for loop makes the code easier to read and reduces errors by removing manual index or iterator handling.


std::vector<int> numbers = {1, 2, 3, 4};

// traditional loop
for (size_t i = 0; i < numbers.size(); i++)
{
    std::cout << numbers[i] << std::endl;
}

// range-based for (recommended)
for (int value : numbers)
{
    std::cout << value << std::endl;
}