Algorithms are derived for allocating and deallocating blocks of memory using binary buddy, weighted buddy and variant weighted buddy partitioning; and transformations are demonstrated for converting recursive into non-recursive forms. Algorithms are given for the relatively difficult computation of the addressed and size of a buddy slot in the weighted versions, and complexity and optimization are also considered.