I have an algorithm in which I want to dynamically allocate some memory. Let's say that I have N numbers and that I want to describe some binary relation over them. To do so I want to create a N*N matrix. But how fast is the memory allocation itself regarding N?
I do not want to zero out the new memory. In fact I do not want to touch it at all in this moment - I just want to allocate it and be sure that all of it is there.
I understand that the answer is: how is the memory allocation implemented? Bit I hope that you can give me some upper bounds that are common for most of the popular memory management strategies.