What is Dynamic Memory Allocation?

Difficulty Level : Medium Last Updated : 08 FebResources are

always a premium we've strived to realize better utilization of resources in the least times; that's the
premise of our progress associated with this pursuit is that the concept of memory
allocationMemory has got to be allocated to the variables that we create in order that actual
variables are often delivered to existence Now there's a constraint as how we expect it happens and
the way it actually happensHow computer creates a variable?When we consider creating something we
expect of making something from the very scratch while this isn’t what actually happens when a
computer creates a variable ‘X’; to the pc is more like an allocation the pc just assigns a memory cell
from tons of pre-existing memory cells to X It’s like someone named ‘RAJESH’ being allocated to
a bedroom from tons of free or empty pre-existing rooms this instance probably made it very clear as
how the pc does the allocation of memory what's Static Memory Allocation? once we declare
variables we actually are preparing all the variables which will be used in order that the compiler
knows that the variable getting used is really a crucial a part of the program that the user wants and
not just a rogue symbol floating around once we declare variables what the compiler actually does is
allocate those variables to their rooms (refer to the hotel analogy earlier)  if you see this is often being
done before the program executes you can’t allocate variables by this method while the program is
executingfilter_nonebrightness_4// All the variables in below program // are statically allocatedvoid
fun() int main() int c[10] Why can we got to introduce another allocation method of this just gets the
work done? Why would we'd like to allocate memory while the program is executing? Because albeit it
isn’t blatantly visible not having the ability to allocate memory during run time precludes flexibility
and compromises with space efficiency those cases where the input isn’t known beforehand we suffer in
terms of inefficient storage use and lack or more than slots to enter data (given an array or similar data
structures to store entries) here we define Dynamic Memory Allocation: The mechanism by which
storage/memory/cells are often allocated to variables during the run time is named Dynamic Memory
Allocation (not to be confused with DMA) as we've been browsing it all we will tell that it allocates the
memory during the run time which enables us to use the maximum amount storage as we would
like without fear about any wastageDynamic memory allocation is that the process of assigning the
memory space during the execution time or the run timeReasons and Advantage of allocating memory
dynamically:When we don't skills much amount of memory would be needed for the program
beforehandWhen we want data structures with none upper limit of memory spaceWhen you want to use
your memory space more efficientlyExample: If you've got allocated memory space for a 1D array as
array[20] and you finish up using only 10 memory spaces then the remaining 10 memory spaces would
be wasted and this wasted memory cannot even be utilized by other program variablesDynamically
created lists insertions and deletions are often done very easily just by the manipulation of addresses
whereas just in case of statically allocated memory insertions and deletions cause more movements and
wastage of memoryWhen you want you to use the concept of structures and linked list in
programming dynamic memory allocation may be a mustfilter_nonebrightness_4int main() // Below
variables are allocated memory // dynamically int *ptr1 = new int; int *ptr2 = new int[10]; //
Dynamically allocated memory is // deallocated delete ptr1; delete [] ptr2; There are two sorts
of available memories- stack and heap Static memory allocation can only be done on stack whereas
dynamic memory allocation are often done on both stack and heap An example of dynamic allocation to
be done on the stack is recursion where the functions are put into call stack so as of their occurrence and
popped off one by one on reaching the bottom case Example of dynamic memory allocation on the heap
is:filter_nonebrightness_4int main() // Below variables are allocated memory // dynamically on heap int
*ptr1 = new int; int *ptr2 = new int[10]; // Dynamically allocated memory is // deallocated delete
ptr1; delete [] ptr2; While allocating memory on heap we'd like to delete the memory manually as
memory isn't freed(deallocated) by the compiler itself albeit the scope of allocated memory
finishes(as just in case of stack)To conclude the above topic static memory are some things that the
compiler allocates beforehand While dynamic memory are some things that's controlled by the
program during execution The program may ask more of it or may delete some allocatedAttention
reader! Don’t stop learning now line up of all the important C++ Foundation and STL concepts with the
C++ Foundation and STL courses at a student-friendly price and become industry
readyRECOMMENDED ARTICLESDifference between Static and Dynamic Memory Allocation in
CImplementation of all Partition Allocation Methods in Memory ManagementMemory Allocation in
Static Data Members in C++If memory allocation using new is failed in C++ then how it should be
handled?How to restrict dynamic allocation of objects in C++?new and delete operators in C++ for
dynamic memoryImplementation of file allocation methods using vectorsC++ Program  which will fill
whole memoryCommon Memory/Pointer Related bug in C ProgramsMemory leak in C++  and the
way to avoid it?Chat application between two processes using signals and shared memoryHow to create
a dynamic 2D array inside a category in C++ ?favorite_borderSquares of numbers with repeated single
digits | Set 1 (3Shift Reduce Parser in CompilerArticle Contributed By
:https://mediageeksforgeeksorg/auth/avatarNishant Chauhan 3@Nishant Chauhan 3Vote for
difficultyCurrent difficulty : MediumImproved By :Rupali ChawlaB