Difference between Pointer and Reference in Programming
Last Updated :
23 May, 2024
Effective memory management is essential in the field of programming. When talking about memory addresses and data access, two key ideas—pointers and references—come into play. Writing clean and secure code requires an understanding of their primary differences, even though they have certain similarities.
Pointers
Consider a pointer to be a compass that directs you to a particular spot. The memory address of another variable is kept in a pointer variable. This address tells you where to find the actual data, much like a compass direction. The dereference operator (*), which functions as a compass to guide you to the destination, is used to access the data.
Key characteristics of pointers:
- Can be null, meaning they don't point to any valid memory location.
- Can be reassigned to point to different variables.
- Need to be dereferenced to access the data they point to.
- Offer more flexibility but can be error-prone if not used carefully (dangling pointers, memory leaks).
Example:
int x = 10;
int* ptr = &x; // ptr now points to the memory address of x
int value = *ptr; // dereference ptr to access the value at x (which is 10)
C++
#include <iostream>
using namespace std;
int main()
{
int x = 10; // Integer variable
int* ptr = &x; // Pointer variable that stores the
// address of x
cout << "Value of x: " << x
<< endl; // Outputs the value of x
cout << "Memory address of x: " << ptr
<< endl; // Outputs the memory address of x
cout << "Value at the memory address stored in ptr: "
<< *ptr
<< endl; // Dereferences ptr to get the value of x
return 0;
}
Java
public class Main {
public static void main(String[] args) {
int x = 10; // Integer variable
Integer X = new Integer(x); // Integer object
int ptr = System.identityHashCode(X); // Memory address of X
System.out.println("Value of x: " + x);
System.out.println("Memory address of x: " + ptr);
System.out.println("Value at the memory address stored in ptr: " + X.intValue());
}
}
OutputValue of x: 10
Memory address of x: 0x7ffc13f1d454
Value at the memory address stored in ptr: 10
References
Think about a reference as a different name for an already-existing variable, similar to an alias. Basically, you're creating a second way to access the same memory when you create a reference. References need to be initialized at declaration with a valid variable, unlike pointers, which are not nullable.
Key characteristics of references:
- Always refer to an existing variable.
- Cannot be reassigned to point to another variable.
- Accessed directly, no dereferencing required.
- Generally safer to use than pointers as they prevent null pointer exceptions.
Example:
int x = 10;
int& ref = x; // ref becomes another name for x
ref = 20; // Modifying ref modifies x as well (x is now 20)
C++
#include <iostream>
using namespace std;
int main() {
int x = 10; // Integer variable
int& ref = x; // Reference to x
cout << "Original value of x: " << x << endl; // Outputs 10
ref = 20; // Modifying ref modifies x
cout << "New value of x: " << x << endl; // Outputs 20
return 0;
}
Java
public class Main {
public static void main(String[] args) {
int[] x = new int[1]; // Integer array with one element
x[0] = 10; // Assigning 10 to the first element
System.out.println("Original value of x: " + x[0]); // Outputs 10
x[0] = 20; // Modifying the first element of the array modifies x
System.out.println("New value of x: " + x[0]); // Outputs 20
}
}
Python
x = [10]
# Reference to x
ref = x
print("Original value of x:", x[0]) # Outputs 10
# Modifying ref modifies x
ref[0] = 20
print("New value of x:", x[0]) # Outputs 20
JavaScript
// JavaScript program demonstrating object references
// Create an object
let obj = { value: 10 };
// Reference to the object
let ref = obj;
// Display the original value
console.log("Original value of obj.value:", obj.value); // Outputs 10
// Modify the value through the reference
ref.value = 20;
// Display the updated value
console.log("New value of obj.value:", obj.value); // Outputs 20
OutputOriginal value of x: 10
New value of x: 20
Differences between pointers and references:
Feature
| Pointer
| Reference
|
---|
Definition
| Stores the memory address of another variable
| Creates an alias for an existing variable
|
---|
Initialization
| Can be declared without initialization
| Must be initialized with a valid variable at declaration
|
---|
Null Value
| Can be assigned NULL
| Cannot be assigned NULL
|
---|
Reassignment
| Can be reassigned to point to different variables
| Cannot be reassigned to another variable
|
---|
Memory Allocation
| Does not allocate memory itself
| Does not allocate memory itself
|
---|
Memory Location
| Has its own memory address and size
| Shares the memory address of the original variable
|
---|
Access
| Accessed through dereferencing (*)
| Accessed directly (no dereferencing required)
|
---|
Safety
| More error-prone (dangling pointers, memory leaks)
| Generally safer (prevents null pointer exceptions)
|
---|
Use Cases
| Dynamic memory allocation, complex data structures
| Function arguments (pass by reference), improve readability
|
---|
Similar Reads
DSA Tutorial - Learn Data Structures and Algorithms DSA (Data Structures and Algorithms) is the study of organizing data efficiently using data structures like arrays, stacks, and trees, paired with step-by-step procedures (or algorithms) to solve problems effectively. Data structures manage how data is stored and accessed, while algorithms focus on
7 min read
Non-linear Components In electrical circuits, Non-linear Components are electronic devices that need an external power source to operate actively. Non-Linear Components are those that are changed with respect to the voltage and current. Elements that do not follow ohm's law are called Non-linear Components. Non-linear Co
11 min read
Quick Sort QuickSort is a sorting algorithm based on the Divide and Conquer that picks an element as a pivot and partitions the given array around the picked pivot by placing the pivot in its correct position in the sorted array. It works on the principle of divide and conquer, breaking down the problem into s
12 min read
Merge Sort - Data Structure and Algorithms Tutorials Merge sort is a popular sorting algorithm known for its efficiency and stability. It follows the divide-and-conquer approach. It works by recursively dividing the input array into two halves, recursively sorting the two halves and finally merging them back together to obtain the sorted array. Merge
14 min read
Data Structures Tutorial Data structures are the fundamental building blocks of computer programming. They define how data is organized, stored, and manipulated within a program. Understanding data structures is very important for developing efficient and effective algorithms. What is Data Structure?A data structure is a st
2 min read
Bubble Sort Algorithm Bubble Sort is the simplest sorting algorithm that works by repeatedly swapping the adjacent elements if they are in the wrong order. This algorithm is not suitable for large data sets as its average and worst-case time complexity are quite high.We sort the array using multiple passes. After the fir
8 min read
Breadth First Search or BFS for a Graph Given a undirected graph represented by an adjacency list adj, where each adj[i] represents the list of vertices connected to vertex i. Perform a Breadth First Search (BFS) traversal starting from vertex 0, visiting vertices from left to right according to the adjacency list, and return a list conta
15+ min read
Binary Search Algorithm - Iterative and Recursive Implementation Binary Search Algorithm is a searching algorithm used in a sorted array by repeatedly dividing the search interval in half. The idea of binary search is to use the information that the array is sorted and reduce the time complexity to O(log N). Binary Search AlgorithmConditions to apply Binary Searc
15 min read
Insertion Sort Algorithm Insertion sort is a simple sorting algorithm that works by iteratively inserting each element of an unsorted list into its correct position in a sorted portion of the list. It is like sorting playing cards in your hands. You split the cards into two groups: the sorted cards and the unsorted cards. T
9 min read
Array Data Structure Guide In this article, we introduce array, implementation in different popular languages, its basic operations and commonly seen problems / interview questions. An array stores items (in case of C/C++ and Java Primitive Arrays) or their references (in case of Python, JS, Java Non-Primitive) at contiguous
4 min read