Discuss two main approaches to reuse free memory area in a heap.

Two major approaches to reuse free memory area in a heap are:

First-fit: Allocate the first hole which is big sufficient. Searching can begin either at the starting of the set of holes or where the previous first-fit search ended. Searching is stopped immediately when a free hole is found which is large enough

Best-fit: Assign the smallest hole which is big enough; whole list is searched, unless ordered through size. This strategy generates the smallest leftover hole.