Mark–compact algorithm

The Mark-Compact algorithm is a garbage collection technique used in memory management to reclaim unused memory in programming environments. It is a form of tracing garbage collection that works in two primary phases: marking and compacting. Here’s a brief overview of how the Mark-Compact algorithm works: 1. **Mark Phase**: - The algorithm begins by traversing the object graph starting from a set of "root" objects (e.g., global variables, local variables on the stack).