CareerCup

void *f = starting_memory_location;

void* myMalloc(int n)
{
//algorithm
(1)search for the first free node which has atlest n bytes in a circular linked list pointed by f(you have to change f, so that it circulates)(at start, theres only one node in the list with bytes as total available free space for dynamic allocation)
(2)when u find the node, if its size of free bytes equals to 'n', then mark it as used. else if its size is grater then 'n'(say 'm') then split it into 2 nodes, with firat node with size 'n'(marked as allocated) and another node with size (m-n) and marked as available
(3)if u go round 1 full rotation then return NULL

I think in myMalloc function the parameter passed "int n" should not be bytes to be allocated.
Before allocation it should be properly aligned or padded.(based on the memory manager)

we can use realloc...

we can use realloc function ...

void * myMalloc(int n)
{

/*f is pointing to free chunk of m byte */
void *p=f;
if(n>m) {
printf("Error: insufficient memory");
return NULL;
}
m=m-n;
f=f+n;
return p;

}

void* myMalloc(int n) {
*(int*)(f) = n// record the number of bytes allocated so that the runtime can free later
return f
}