41 Mark and Sweep It (a lazy method) puts off reclaiming any storage until the allocator runs out of space, at which point it looks for all storage that can be referenced and removes all unreferenced storage back to the free list The first pass follows all pointers recursively, starting with the symbol table, and marks each of block reached with an extra bit The second pass then sweeps linearly through memory, returning unmarked blocks to the free list
{}