Simplest solution

• one free list for all sizes
• each block stores its size

Problem: efficiency of finding appropriate block

Array of free lists:

• for (almost) each size
• when allocating block of size B, search in free(B), or in free(i) for i >= B