What are the disadvantages in implementing buddy system algorithm for free lists?
(a) internal fragmentation
(b) it takes so much space
(c) we no more have the hole lists in order of memory address, so it is difficult to detect if 2 holes remain adjacent in memory and shall be merged into one hole
(d) both a and c are correct
This intriguing question originated from Free List in division Types of Lists of Data Structures & Algorithms I
The question was posed to me in an online quiz.