Mark–compact algorithm

The mark-compact algorithm is an garbage collection algorithm used to reclaim unreachable memory. It can be regarded as a hybrid of the mark-sweep algorithm and Cheney's copying algorithm. First, reachable objects are marked, then a compacting step relocates the reachable (marked) objects towards the beginning of the heap area. Compacting garbage collection is used by Microsoft's Common Language Runtime.