Dynamic memory allocation in C++ allows memory to be allocated during program execution. It helps programs use memory efficiently according to their needs.<\/p>\n\n\n\n
Dynamic memory allocation means creating memory at runtime instead of compile time. The memory is allocated from heap memory using pointers.<\/p>\n\n\n\n
Dynamic memory allocation is useful because it:<\/p>\n\n\n\n
Dynamic memory is stored in the heap area of memory.<\/p>\n\n\n\n
Unlike stack memory, heap memory is manually managed by the programmer.<\/p>\n\n\n\n
C++ provides:<\/p>\n\n\n\n
new<\/code> \u2192 allocate memory<\/li>\n\n\n\ndelete<\/code> \u2192 free memory<\/li>\n<\/ul>\n\n\n\nAllocating Single Variable<\/h2>\n\n\n\nint *ptr = new int;<\/code><\/pre>\n\n\n\nAssigning Value<\/h2>\n\n\n\n*ptr = 100;<\/code><\/pre>\n\n\n\nExample Program<\/h2>\n\n\n\n#include <iostream>
using namespace std;
int main() {
int *ptr = new int;
*ptr = 50;
cout << *ptr << endl;
delete ptr;
return 0;
}<\/code><\/pre>\n\n\n\nOutput<\/h2>\n\n\n\n50<\/code><\/pre>\n\n\n\nHow Dynamic Allocation Works<\/h2>\n\n\n\n\nnew<\/code> allocates memory in heap<\/li>\n\n\n\n- Pointer stores memory address<\/li>\n\n\n\n
- Data is accessed using pointer<\/li>\n\n\n\n
delete<\/code> frees allocated memory<\/li>\n<\/ol>\n\n\n\nDynamic Array Allocation<\/h2>\n\n\n\nint *arr = new int[5];<\/code><\/pre>\n\n\n\nThis creates an array of 5 integers dynamically.<\/p>\n\n\n\n
Example of Dynamic Array<\/h2>\n\n\n\n#include <iostream>
using namespace std;
int main() {
int size = 5;
int *arr = new int[size];
for (int i = 0; i < size; i++) {
arr[i] = i + 1;
}
for (int i = 0; i < size; i++) {
cout << arr[i] << endl;
}
delete[] arr;
return 0;
}<\/code><\/pre>\n\n\n\ndelete vs delete[]<\/h2>\n\n\n\ndelete<\/th> delete[]<\/th><\/tr><\/thead> Used for single variable<\/td> Used for arrays<\/td><\/tr> Frees one memory block<\/td> Frees multiple memory blocks<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\nNull Pointer After Deletion<\/h2>\n\n\n\n
Good practice:<\/p>\n\n\n\n
ptr = nullptr;<\/code><\/pre>\n\n\n\nThis avoids dangling pointers.<\/p>\n\n\n\n
Memory Leak<\/h2>\n\n\n\n
A memory leak happens when allocated memory is not released.<\/p>\n\n\n\n
Example of Memory Leak<\/h3>\n\n\n\nint *ptr = new int;
\/\/ forgot delete<\/code><\/pre>\n\n\n\nDangling Pointer<\/h2>\n\n\n\n
A dangling pointer points to memory that has already been freed.<\/p>\n\n\n\n
delete ptr;<\/code><\/pre>\n\n\n\nAfter deletion:<\/p>\n\n\n\n
ptr = nullptr;<\/code><\/pre>\n\n\n\nAdvantages of Dynamic Memory Allocation<\/h2>\n\n\n\n\n- Flexible memory usage<\/li>\n\n\n\n
- Efficient resource management<\/li>\n\n\n\n
- Useful for large programs<\/li>\n\n\n\n
- Supports dynamic data structures<\/li>\n<\/ul>\n\n\n\n
Disadvantages<\/h2>\n\n\n\n\n- Manual memory handling required<\/li>\n\n\n\n
- Risk of memory leaks<\/li>\n\n\n\n
- More complex than static memory<\/li>\n<\/ul>\n\n\n\n
Why Dynamic Memory Allocation is Important<\/h2>\n\n\n\n
It is important because it:<\/p>\n\n\n\n
\n- Allows efficient memory management<\/li>\n\n\n\n
- Supports linked lists, trees, and graphs<\/li>\n\n\n\n
- Helps build scalable applications<\/li>\n\n\n\n
- Is essential for advanced programming<\/li>\n<\/ul>\n\n\n\n
Real-Life Example<\/h2>\n\n\n\n
Think of renting rooms in a hotel:<\/p>\n\n\n\n
\n- Rooms are booked only when needed<\/li>\n\n\n\n
- Unused rooms are released later<\/li>\n<\/ul>\n\n\n\n<\/strong>
<\/p> <\/div> <\/div>\n\n\n\n
Dynamic memory works similarly by allocating memory only when required.<\/p>\n\n\n\n
Conclusion<\/h2>\n\n\n\n
Dynamic memory allocation in C++ allows programmers to manage memory during runtime using new<\/code> and delete<\/code>. It provides flexibility, efficient memory usage, and support for advanced programming concepts and data structures.<\/p>\n\n\n