To achieve this, some form of dynamic memory allocation is usually required.

The heap is a structure used by software to manage memory allocation.

There are non-graphics calls like memory allocation and things that don't involve graphics.

Further, dynamic memory allocation and garbage collection can be made available if supported by the language.

For instance, there is no support for dynamic memory allocation.

A free list is a data structure used in a scheme for dynamic memory allocation.

The stack blows its memory allocation and the program crashes, usually very quickly.

When memory allocation is required, the new and delete operators are called implicitly.

For this reason, dynamic memory allocation is frowned upon.

That can include processing power, memory allocation and computer storage access, among other things.