Free

Free will behave differently depending on which strategy is used when running the function. We will divide it into an original implementation and a quick fit implementation. Both implementations will show, in a pseudo kind of way, which functions and operations that executes when free is called.

###Original implementation This implementation will be used when strategy is set to either of 1, 2, and 3, which corresponds to first fit, best fit and worst fit.

Note that the function call to concat_nodes is used for memory management and that free would work without it.

###Quick fit implementation This implementation will be used when strategy is set to 4, which corresponds to quick fit.

Note that the function call to quick_concat is used for memory management and that free would work without it.