First Fit and Next Fit are both easy to implement once the linked list manipulation code is available.

Best Fit or worst fit require more coding and more time to keep the free list sorted.

Alternatively some data structure other than a linked list might be more efficient for best fit or worst fit.