Skip to content

Latest commit

 

History

History
6 lines (4 loc) · 352 Bytes

README.md

File metadata and controls

6 lines (4 loc) · 352 Bytes

fibonacci-malloc

Project for CSCE313 at Texas A&M university to rewrite malloc using a fibonacci sequence as opposed to typical binary splitting. This implementation of malloc is then tested with the ackerman function to test its efficiency against standard C malloc.

If you are in this course, please do not copy this material.